1- Find the Big -O of the merge sort algorithm using the Iteration Method.

T(n) = 2T(n/2)+an +d n>1

c n=1

2- Use the master theorem to prove your answer in part 1