$(2$ points$)$ Compute the big O time complexity $($worst case$)$ of the following code. Show all

your work to get credit, including a table of steps to $n($as seen in class$),$ and then

all the summations and all your work to compute the time complexity.