4. Consider the following algorithm Algorithm XYZ(n) n is positive integers 1, if n = 0 or = 1 then return 1 2. else 5, for i 2 to n temp b bb+a 6, 7, 8, 9. atemp return b a. What does the algorithm compute? b. What is the complexity of XYZ? c. Write a recursive version of XYZ. Name it RecursiveXYZ. d. What is the recurrence relation of your algorithm RecursiveXYZ