1. $$\begin{aligned} & \text { Kerry (K) }
& \text { Nikki (N) }
& \text { Violet (V) }
& \text { Dev (D) }
& \text { Henri (H) }
& \text { Leslie (L) }
& \text { Enlai (E) }
& \text { Sylvester (S) }
& \text { Joan (J) } \end{aligned}$$ A binary search is to be performed on the names in the list above to locate the name Leslie.

1. Explain why a binary search cannot be performed with the list in its present form.
2. Using an appropriate algorithm, alter the list so that a binary search can be performed. You should state the name of the algorithm you use and show the list after each complete iteration.
3. Use the binary search algorithm to locate the name Leslie in the altered list you obtained in (b). You must make your method clear. The binary search algorithm is to be used to search for a name in an alphabetical list of 727 names.
4. Find the maximum number of iterations needed. You should justify your answer.