Question 2 50 pts 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 S 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. When j is equal to 5, the inner loop will execute ISelect ] [ Select ] ISelect ] times, when j is equal to 5, Line # 3 will perform comparisons. This algorithm will most likely grow like sortArrayDecreasing(5) 1: n=A.length 2: for j 1 to n-1 3: for i j.1 to n 4: 5: 6: 7: 6: return aSt3) sti]- a