3. Consider the following algorithm Algorithm XYz(r.g.n) Ir,q, n are positive integers if n = 1 then return r 2. else 3. if n is odd then return XYZ(r.q,n -1) + (n -1)q 4. else return XYZ(r, q, n-1) - (n 1)q a. b. C. What does the algorithm compute? What is the recurrence relation for the algorithm? What is the time complexity of the algorithm (solve the recurrence in part b). 4. Consider the following algorithm Algorithm XYZ(n) IIn is positive integers 1. ifn - 0 or1 then return 1 2. else 4. b-1 5. fori +2 to n 6. temp b 8. a temp 4. Consider the following algorithm Algorithm XYZ(n) IIn is positive integers 1. ifn - 0 or1 then return 1 2. else 5, for i 2 to n