
.(5 points) Consider the algorithm alongside which accepts as inuta Rid) positive integer n. (a) (2 points) Write down the recurrence expressing the number of “n If (n41) return for i-1 to n print(“*” that get printed. Justify the recurrence you found b) (3 points) Solve the recurrence using any method you like and give Riddle(n/3) Riddle(n/3); an asymptotic expression for the number of ” printed You are told that A takes 10ms to process 5
PayPal Gateway not configured
PayPal Gateway not configured