Here is pseudocode for a method to find the maximum value in an array.

MAX$([1..])$

$=1$

$[1]$

$=/2$

$=$ MAX$([1..])$

$=$ MAX$([+1..])$

$>$

$$

$$

$$

a$)$ Write down the recurrence relation counting the number of times the $>$

$$ comparison is performed.

b$)$ Draw a recursion tree $($levels $0,1,2,$ and $)$ corresponding to that recurrence relation.

c$)$ Write down the asymptotic formula $($that is$,$ using big$-$Oh notation$)$ derived from that

recursion tree