How many comparisons total are required to separately find the minimum and maximum elements of an unsorted array (i.e. we will find the min and then completely independently find the max)?

Connect the case to the right answer. Please, include the explanation for your choice.

Best case A) n - 1

Average case B) 2n - 2

Worst case C) n - 1

D) n

E) n

F) n -1

G) 2n -2

H) n

I) 2n -2