Q3) (30 points) consider the following algorithm Algorithm XYZ(n) \ is positive integers 1. if n = 0 or = 1 then return 1 2. else 3. 00 4 b1 5. for i 2 ton 6. temp - b 7. beb+ a 8. atemp 9. 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 Recursive XYZ