$[$Asymptotic Analysis and Function Growth$]$ Consider the given pseudo code. Write the function $()$ in terms of the number of operations, and then give the asymptotic $($big Oh$)$ complexity of the algorithm, show all the work you do$.[$ you may write the summation formula and solve it$,$ or use the $$Look for pattern$$method$]$ a$.$ T$($n$)=$ the running time of the code as a function of the variable n public void code$($int n$)\{$ for $($int i $=0$; i $<$ n; i$++)\{$ for $($int j $=5$; j $<$ i; j$++)\{$ printf$($Hello$!)$; $\}$ for $($int j $=$ i; j $>=0$; j