2. (a) Use the binary search algorithm to locate the name HUSSAIN in the following alphabetical list. Explain each step of the algorithm.
- ALLEN
- BALL
- COOPER
- EVANS
- HUSSAIN
- JONES
- MICHAEL
- PATEL
- RICHARDS
- TINDALL
- WU
(b) State the maximum number of comparisons that need to be made to locate a name in an alphabetical list of 11 names.
(1 mark)
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{c1b75596-bbab-4278-8503-7cfbea0bc5f1-3_816_1298_343_391}
\captionsetup{labelformat=empty}
\caption{Fig. 1}
\end{figure}
(a) Using an appropriate algorithm, obtain a suitable route starting and finishing at \(A\).
(b) Calculate the total length of this route.