Problem definition: We have an unsorted array $24,75,92,83,61,48,97,50.$ Let

$\text{'}$s find MAX and MIN using your findMaxMin algorithm

Step$1$: Implement two types of findMaxMin algorithm $($Refer to pseudo cod

e in another image$)$

First type should yield $2n-2$ comparison

First type should yield $\frac{3n}{2}-2$ comparisons

Step$2$: Analyze the time complexities of your implementations

Sufficient details have to be provided based on your code and time complexity

$($This complexity analysis just shows the number of comparisons based on your code,

NOT use recurrence relations and asymptotic bound$)$