6a.Compute the running time 15 points
and hence the time
complexity of this program
6marks 6b.Briefly explain,
why binary search method is
preferred over a sequential
search? 3marks 6c. Suppose
you have the following sorted
list [2, 5, 6, 8, 9, 12, 19] and are
using the iterative binary
search algorithm. Carefully
write out the group of
numbers in this format: (first,
last and mid values) that
correctly shows the
sequence of comparisons
used to find the key 6 and 12.
6marks