Describe the worst$-$case input $($causes largest running time$)$ and the $\backslash$Theta $-$bound.

c$.$ Provide summations that are used to calculate the number of steps for the worst case. Comment on how each line of code relates to summation. Loops require discussing number of iterations and steps per iteration. The summation does not need to be perfect but it should be close. For example, being off by $1$ is fine.