1. Complete the algorithm below for a method to return the position of the smallest item in array data with bounds 0..limit. What is the time complexity of this algorithm?

positionOfSmallest(data[0..limit])

1. set largest = data[0].

2. set indexOfLargest = 0.

3. set index = 1.

happy if anyone can answer this questions as soon as possible

thank you!!!!!!!