Consider the following algorithm:

$A[5,3,2,9]$ ALGORITHM Secret $(A[0$dotsn$-1])$

for ilarr$0ton-2do$

minlarri

for jlarri$+1ton-1do$

$ifA[j]$

How many comparisons and swaps $do$ the above algorithm require $to$ process $A[5,3,2,9]$

$A.3$ comparisons, $1$ swap

$B.4$ comparisons, $1$ swap

$C.5$ comparisons, $1$ swap

$D.6$ comparisons, $1$ swap