Solve the following recurrence relation based on recurrence tree method. (do not need to go over the induction at the end)

T (n)=7 T (n/2)+n ,whereT (1)=1 2.

Express the recurrence relation of the following recursive function.

void magicFunction(int [] data, int i, int j) { if (i < j) { mergeSort(data, i, j); magicFunction(data, i, (i+j)/2); magicFunction(data, (i+j)/2 + 1, j); } }