If a$[]$ is an array of integers, the pseudo code

int k $=0$

int m $=1$

While m $<$ a$.$length

If a$[$m$]<$ a$[$k$]$ Then

k $=$ m

End If

m $=$ m$+1$

End While

describes a strategy for $\_\_\_\_\_\_\_\_.$

sorting an array in descending order

implementing a part of the logic for bubble sort

determining the location of the smallest value in the array

sorting an array in ascending order