Please code the following in Python. Thanks. I'll give upvote if correct. Make a Big-O function that accepts, as an input, a list of size n and prints all the integers from 1 up to n. Follow the...

Please code the following in Python. Thanks. I'll give upvote if correct.

Make a Big-O function that accepts, as an input, a list of size n and prints all the integers from 1 up to n.
Follow the restrictions that are enumerated below:

• You must only print each number
  once
  (-4/20)


• The algorithm/code function must have complexity to O(n^2) (-20/20).
  It needs to be O(n^2) hence -20/20.
  


• The input must be a list
  not
  an integer (-4/20).

An example of this is if the input is a list of size 4, the output is:

1

2

3

4