a) Give the asymptotic value (using the E-notation) for the number of letters that will be printed by the algorithms below. In each algorithm the argument n is a positive integer. Your solution needs to consist of an appropriate recurrence equation and its solution. You also need to give a brief justification for the recurrence (at most 10 words each). (i) Algorithm PRINTAs (n : integer) if n