Problem $2.$ Consider the following sorting algorithm. The algorithm operates in stages from $1$ to $\backslash ($ n$-1\backslash ).$ During the $\backslash ($ i $\backslash )$ th stage, the algorithm finds the minimum element of the subarray $\backslash (\backslash$mathrm$\{$A$\}[\backslash$mathrm$\{$i$\}..\backslash$mathrm$\{$n$\}]\backslash )$ and swaps it into its final sorted location in $\backslash (\backslash$mathrm$\{$A$\}[$i$]\backslash ).$

$```$

SomeSort$($A$[1..$n$])\{$

for i $=1$ to n$-1$ do $\{$

min $=$ i

for j $=$ i$+1$ to n do $\{$

if $($A$[$j$]$ A$[$min$])$

min $=$ j;

$\}$

swap A$[$i$]$ with A$[$min$]$

$\}$

$\}$

$```$

This sort is NOT stable. Give an example of an array with exactly $3($three$)$ integer elements to demonstrate that SomeSort is not stable. Label duplicate elements with subscripts $($e$.$g$.\backslash (2\_\{$a$\},2\_\{$b$\}\backslash ),$ etc.$)$