k$=1,$min $=0$

$2$ for i$=1$ to A$.$length

$3$ min $=$ A$[$i$]$

$4$ for j$=$ i$+1$ to A$.$length

$5$ if min$>$A$[$i$]$

$6$ min $=$ A$[$i$]$

$7$ k$=$j

$8$ if A$[$i$]>$ min

$9$ swap $($A$[$i$],$ A$[$k$])$

Think of two scenarios where you need to compute the lower bound and upper bound of

the Selection Sort Algorithm given below.