7. In the mergesort the sorting of an array is achieved by dividing an array into two halves and it includestwo steps. The sorting each of them recursively and then merging the two sorted arrays into a single one. Please find the efficiency of the mergesort using recurrence. 8. Consider the Tower of Hanoi problem. Please provide the recursive solution for the sequence of c1,c2,c3..,cn, where cn is the number of moves to solve the n-disk problem. After finding the recurrence relation find the formula for cn that gives the minimum number of moves in which the n-disk Tower problem can be solved