1. Give a recurrence relation, t(n), that expresses the number of times, a value in the array A is accessed (read or write) in the worst case by a call to repetitiveRecursion CO,n-1,A), where@ ienotes the length of A. You can assume that2#, where r is a non-negatiye integer. Include any necessary base cases in your recurrence relation. Hint: When n 2, each of the recursive calls in a given instance of repetitiveRecursion is on a subproblem of the same size. -i+1 may be helpful in expressing the problem size in terms of the Hint: The equation n parameters i and j. 1 public void repetitiveRecursion (int i, int j, int O A) int mid (itj)/2; if (i y) f A[j] = x; repetitiveRecursion (i, mid, A); repetitiveRecursion (mid+1,j, A); 10 12 13 14 15