I 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)=77(1/2)+n, where (1)=1 2. Express the recurrence relation of the following recursive function. void magicFunction in [data, int i, inti) if(i