Problem 1: Give an asymptotic estimate for the number D(n) of “D"s printed by Algorithm PRINT Ds below. Your solution must consist of the following steps: (a) First express D(n) using the summation...

Extracted text: Problem 1: Give an asymptotic estimate for the number D(n) of “D"s printed by Algorithm PRINT Ds below. Your solution must consist of the following steps: (a) First express D(n) using the summation notation E. (b) Next, give a closed-form expression' for D(n). (c) Finally, give the asymptotic value of D(n) using the O-notation. Show your work and include justification for each step. Algorithm PRINT_Ds (n : integer) for i + 4 to 3n do for j+1 to (i + 1)² do print(“D") for i +1 to n+ 2 do for j + 2 to 4i do print(“D") Note: If you need any summation formulas for this problem, you are allowed to look them up. You do not need to prove them, you can just state in the assignment when you use them.