Question: (a) Describe a ternary search algorithm, which searches an ordered list for a given element by successively dividing the list into thirds and determining in which third the element must lie.
(b) Show that the complexity of the algorithm found in (a) (in terms of comparisons) is 0(log 3 n).