Please help choose the correct answers from the drop down menu for each space:

[Select] [Select] O(1) Odlog n) O(n) O(n log n) O(n^2) O(n^2 log n) O(n^3) (2^n) None of the above You are given your implementation of the five, set_to_user_input (which initializes the elements of list to user defined values), and the algorithm manage_list presented below. State the O (big-O) complexity of each line in manage_list as well as the complexity of the entire process. (note in your answer choices, is used to denote a base raised to a power, e.g. n^2 equals na, n^3 equals n, and so on.) procedure manage_list(int n) { // COMPLEXITY // ti: a = new int[n Select) for(k=1; k