Feedback for subjective question

Question 1: Determine the complexity of an algorithm that measures the number of print statements in an algorithm that takes a positive integer n and prints 1 one time, 2 two times, 3 three times , ... , n n times.
That is
1
2 2
3 3 3
...
n n n n ... n (n times)
Note:There is no need to write Algorithm(Pseudo code)