1) What is the recurrence relation for 2-way Merge sort?

W(n) =

2) Use the substitution to solve the recurrence for 2-way Merge sort:

W(n) =

3) Analyze the Bubble sort code (p.100) to find