fiNd the "Best" Big-O Notation to Describe the Complexity of the Algorithm

Short Answer

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 !$$
-An algorithm that prints all subsets of size three of the set {1, 2, 3, . . . , n}