b$.$ T$($n$)$ denotes the number of the times the statement "CSE$4310!"$ is printed as a funtion of n$.$ Instructions: 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.