How to solve the question1's d?

Problem 1: Give an asymptotic estimate, using the -notation, of the number of letters printed by the algorithms given below. Give a complete justification for your answer, by providing an appropriate recurrence equation and its solution. (a) algorithm PrintAs(n) (b) algorithm PrintBs(n) ifn1thenprint("AAA")elseforj1ton3doprint("A")fori1to5doPrintAs(n/2)ifn4thenforj1ton2doprint("B")fori1to6doPrintBs(n/4)fori1to10doPrintBs(n/4) (c) algorithm PrintCs (n) (d) algorithm PrintDs(n) ifn2thenprint("C")elseif(x0(mod2))thenforj1tondoprint("C")PrintCs(n/3)PrintCs(n/3)PrintCs(n/3)PrintCs(n/3)ifn5thenprint("D")print("D")PrintDs(n/5)PrintDs(n/5)xx+3elsePrintDs(n/5)PrintDs(n/5)x5x+3 In part (d), variable x is a global variable initialized to 1