Consider the given alorithm where A(1:n) is an array of n integers... A) What does the program do? What are the interpretations of B and C? B) What is the EXACT number comparisons in the best case in...

Consider the given alorithm where A(1:n) is an array of n integers...

A) What does the program do? What are the interpretations of B and C?

B) What is the EXACT number comparisons in the best case in terms of n?

C) What is the EXACT number comparisons in the worst case in terms of n?

Extracted text: B+ A(1); C + A(1) for i = 2 to n do if A(i) > B then B- A(i) else if A(i) < c="" then="" c-="" a(i)="" endif="" endif="">