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 of numbers and output the same sequence S' sorted in increasing 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 [Select] times. When j is equal to 5, Line # 3 will perform [Select ] comparisons. This algorithm will most likely grow like Select ] sortArrayIncreasing(s) 1: n = A.Length 2: for j = 1 to n-1 3: for i = j+1 to n 4: if (S[j] >= S[i]) 5: a =S[j] 6: S[j] = S[i] 7: S[i] = a 6: return