Consider the following algorithm:

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

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

for jlarr$0$ to $n-2-i$ do

if $A[j+1]A[3,5,7,5]A[j+1]$ and $A[j+1]$

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

$a.6,1$

$b.3,6$

$c.6,6$

$d.3,3$