The following recursive algorithm is given to find the maximum element in a given integer array public static int max (int a[], int left, int right) { if (left == right) return a[left]: else { System.out.println("L: " +left+ " R: "+right): return Math.max (a[left], max (a, left+1, right)): } } a) What is input size? b) Let t(n) be number of line the algorithm is printing. Determine recurrence relation for t(n) What is the complexity of method, that is, determine O, Omega, or Theta class of t(n)