Select from multiple dropdowns. Examine the following pseudocode. Each line is numbered (leftmost number). The objective of this exercise is to determine the time complexity of this algorithm that takes as input a sequence of numbers and output the same sequence S' sorted in decreasing order. First, this algorithm has a bug on line # (Select] . Line #2 performs (Select] comparisons and [Select] additions during the full execution of this algorithm. Whenj is equal to 5, the inner loop will execute Select] times. Whenj is equal to 5, Line # 3 will perform [Select] comparisons. This algorithm will most likely grow like [Select] 3: sortArrayDecreasing(s) 1: n = A.Length 2: for j = 1 to n-1 for i = j+1 ton if (S[j] >= S[i]) a =S[j] S[j] = s[i] S[i] = a return ONOU Answer 1: None of these answers Answer 2: Answer 3: n-1 Answer 4: None of these answers Answer 5: n-4 Answer 6: n^2