$6)$ Given the algorithm below: $--$ A $=(1...$n$]//$an array of size n for i $=1$ to k smallest $=$ A$[$i$]$ for j $=$ i $+1$ ton if A$[$j$]<$ A$[$smallest$]$ smallest $=$ j swap $($A$[$i$],$ A$[$smallest$])$ a$)$ What is the goal of this algorithm? b$)$ Find the complexity of the algorithm. Justify your answer.