How many commparisons does the algorithm have? Please explain in detail how to solve this problem. I really want to understand how this works. If possible please type up the steps.

(b) procedure largest (a1,a2,,an : integers with n1 ) max:=a1 for i=2 to n if ai>max then max: =ai returnmax (c) n1 comparisons