$($b$)f(n)=O(g(n)),$ where $f(n)$

Question $2(10$ points$)$: Consider the following algorithm, which takes as input an array A:What is the asymptotic running time of PrintThings$($A$)$ if the length of A is n $?$We expect: an answer like "The running time of PrintThings$($A$)$ is O$($dots$)"$ with a short explanation.