Consider the following algorithm for finding the smallest two elements in an array:

P $($A$)$ :

Input array A$[$O$.$ n$-1]$ with n$>=2$

Output the two smallest elements in A

min$\_$index$1=0,$ min$\_$index$2=0$ for all i$=1..$n$-1$ do

if A$[$il