Consider the following algorithm for finding the largest element that occurs in an array A. To keep things simple, we'll assume that the length of A is a power of 2 int largest (int[] A) return largest(A, , A.length-1); int largest (int[] A, int lo, int hi) if (lo --hi) return A[Io]; else int mid -(lo +hi) 2; return Math .max(1argesta, lo, mid), largesta, mid+1, h)); Derive the recurrence relation for this algorithm, which should be of the form T(n)-a T(n/b) O(nd)