$(0\mathrm{.}5$ points$)$ Compute the complexity and Big $O$ time complexity $($worst case$)$ of the following

pseudocode assuming the print statement is the basic operation. Show all your work step by

step to get credit including summations.

Can you explain complexity and Big O time complexity separately plz and step by step too $?$ thank you.