How do you solve this?

using this

1. Give the number of comparisons required to search a list in each of the following cases. Show the formula in terms of n, and the actuai number of comporisons when n=1000000 A. binary search worst case B. linear search worst case C. linear search average case 1) \begin{tabular}{|l|l|l|} \hline & Formula & Number of comparisons \\ \hline A. & & \\ \hline B. & & \\ \hline C. & & 1 \\ \hline \end{tabular}