How many comparisons are required to find the minimum and maximum elements of an unsorted array when we combine the determination as we did in class?

Best case

Average Case

Worst Case

B) 3(n-1)/2

G) 3n/2

H) 3(n+1)/2

A) 4n/2

C) 2(n-1)/2

D) 4(n-1)/2

E) 4(n+1)/2

F) 2n/2

I) 2(n+1)/2