Consider the following code, which shows a function called by a client with a list of integers as in the following test code.

def someFunction(aList): n = len(aList) for i in range(n): print (aList[i]) for j in range(int(n/2)): print(aList[j] + n) print("all done") listA = [1,2,3,4,5,6,7,8] someFunction(listA)

Select from the options below the complexity of the code.

You may assume that the length of aList (n, in this program) is the size of the problem and a step (i.e. the basic unit of computation) is the print() statement.

For the purpose of this question, you can ignore the complexity of any other parts of the program, such as assignments, addition, division, the index and len() and int() functions.

Select one:

O(1)

O(n³)

O(3n/2)

O(3n/2 + 1)

O(n)

O(n²)