In the Following Code, What Is the Algorithm's Complexity? MinIndex

Multiple Choice

In the following code, what is the algorithm's complexity? minIndex = 0
CurrentIndex = 1
While currentIndex < len(lyst) :
If lyst[currentIndex] < lyst[minIndex]:
MinIndex = currentIndex
CurrentIndex += 1
Return minIndex

A) O( n ²)
B) O( n )
C) O(log₂ n )
D) O²