Q. 1 Solve the recursive equation using recursion tree method and find the complexity. 6 The recurrence equation is of the form given below T(N)=a T(N/b) + f(n) T(1)=1 a=4, b=3, f(n)=N Q. 2 a) Given a series of numbers, sort them on applying merge sort using divide and 8(5+3) conquer approach. As you sort them, write a sequence number (1, 2 ,3 .....) following the way in which the divide and merge operation takes place. Write the number of division operation, merging operation and the total number of operations to sort the items. Nos: 14 100 20 13 2 8 12 18 10 b) Write the pseudocode of merge sort