In Questions fiNd the "Best" Big-O Notation to Describe the Complexity

Short Answer

In questions find the "best" big-O notation to describe the complexity of the algorithm. Choose your
answers from the following:
1, $$\log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-The number of print statements in the following: $$\begin{array} { l } i : = 1 , j : = 1 \\\text { while } i \leq n \\\text { while } j \leq i \\\text { print "hello"; } \\j : = j + 1 \\i : = i + 1\end{array}$$