Q5. Below is the code for power function that computes x. Write the recurrence relation for this function. Solve the recurrence relation using master method (for dividing functions) (8 points) long power(int x, int n) { if(n==0) return 1; if(x==0) return 0; ifn 1) return x; if(n%2=0)// n is even return power(x*x, n/2); else return x * power(x*x, n/2); }