c$.T(n)$ denotes the number of the times the statement: $k=k+1$

executed

Instruction:$[$Asymptotic Complexity$]$ Consider the given pseudo code. Write the function T$($n$)$ in terms of the number of operations, and then give the asymptotic $($big Oh$)$ complexity of the algorithm, show all the work you do$.[$ write the summation formula and solve it$,$ or use the "Look for pattern" method.