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$\text{'}$ sorted in decreasing order.

First, this algorithm has a bug on line #

$.$ Line # $2$ performs comparisons and n$-1$ additions during the full execution of this algorithm. When j is equal to $5,$ the inner loop will execute times. When j is equal to $5,$ Line # $3$ will perform n$-5$ comparisons. This algorithm will most likely grow like

$.$

sortArrayDecreasing$($S$)$

$1$: n $=$ S$.$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