In python, create a code that accepts the size of a list as an input (n). It will print out all the integers from 1 to n (the size of the list). Note that: • the function needs to have the complexity...

Topic: Big-O Notation and Algorithm

Extracted text: In python, create a code that accepts the size of a list as an input (n). It will print out all the integers from 1 to n (the size of the list). Note that: • the function needs to have the complexity of O(n²). • the input is not an integer, but a LIST. • include the equation of the function, as well as its graph Example Input 1: [1, b, t, 0, 2, 8] Example Output 1: 1 2 3 4 5 6