For the following function derive the recursive definition of f(n) with initial conditions. Assume that j-i+1 is a power of 2. f(i.) // ij are the indices of the underlying array A. { if (i == j-1) return minimum(A[i]), A[i+1]); else { m = f(i, (1+1)/2); m2 = f((i+1)/2+1, 1); return minimum(m 1, m2); } } // minimum(x,y) compares x and y and returns the minimum element among them. //A[i, j] refers to the subarray from A[i] through A[j] None of the above. If (i+1 = j) f(ij) = minimum(A[i]), A[i]). //Base case Else f(ij) = f(A[i, (i+j)/2]) //Recursive definition If (i+1 = j) f(0,j) = minimum(A[i], A[j]). //Base case Else f(i) = f(A[(i+j)/2+1,j]) //Recursive definition If (i+1 = j) f(ij) = minimum(A[i], A[j]). //Base case Else f(i.) = minimum(f(A[i, (i+j)/2]), f(A[(i+j)/2+1, j])). //Recursive definition f(ij) = minimum(A[i], A[j])