5. Given the following recursive method (15 points) i) Show the changes to stack during the recursion. Assume initial call to foo is with following values a112, 13, i) What is the methodfoo trying to accomplish ? ii) Write the intial time recurrence, TN), for foo function. 29. 12, 27, 10) and 1 = 0, and r a.length-1. public static int foo (intll a, int l, int r)f if (1 = r) return a[1]; - int m = (1+r) / 2; int u foo (a, l, m); int v foo (a, m+1, r); if (u > v) return u; else return v