Consider the following code fragment: k = 0
for i = 1 to n do
for j = 1 to i do
k = k + 2
if j > 5
then k = k + i
a). at the end of this code fragment, what is the value contained in k (expressed as a closed form function of n)?
b) what is the asymptotic running time of the code fragment (as a closed form function of n)?
justify your answers by explaining and showing your work and/or calculations. for both parts, first express the solution in the form of a summation, and then transform the solution into closed form (no summations in the final answer).