2)

3) What is the total number of worst-case basic operations?

4) Let W(n) be the worst-case "time" to search for n elements. Write a recurrence relation for binary search including base-case(s).

W(n) =

5) Write a recurrence relation for merge sort including base-case(s).

W(n) =