1. Solve the following recurrence relation based on substitution or recurrence tree method. (You do not need to go over the induction at the end) T(n)=7 r(n/2)+n, whereT(1)=1 2. Express the recurrence relation of the following recursive function. void magicFunction(int ( data, int i, int D) { mergeSort(data, 1, 1); magicFunction(data, 1. (i+j)/2); magicFunction(data, (i+])/2 + 1, 1)