: Give the exact and asymptotic formula for the number f(n) of letters A printed by Algorithm PrintAs below. Your solution must consist of the following steps:

Problem 1: Give the exact and asymptotic formula for the number f(n) of letters "A" printed by Algo rithm PRINTAS below. Your solution must consist of the following steps: (a) First express f(n) using a summation notation . (b) Next, give a closed-form formula for 5 (22). (c) Finally, give the asymptotic value of the mumber of A's (using the A notation.) Include justification for each step. Note: If you need any sumination formulas for this problem. vou are allowed to look them up and do not need to prove Algorithm PRINTAS (12 : integer) for 1 to 212 + 1 do for Ito 3 do puin for alto (2n + 112 do for 1 to 13 do print