Consider the following algorithm for sorting an array of numbers:

Mystery $($A$[0..$n$-1])$:

for ilarr$0$ to $n-2$ do

$A[3,5,7,5]minlarri$

for jlarri$+1ton-1do$

$ifA[j]$

For the input array $A[3,5,7,5],$ how many comparisons and swaps are required?

$a.1,3$

$b.3,1$

$c.4,1$

$d.2,2$