Consider the pseudocode below. $(40$ pts$)$

a$)(15$ pts$)$ Write a recurrence relation describing the run time of this function.

Recurrence Relation Claim $(10$ pts$)$:

T$($n$)=\{$

Show your work below on how you got this description $($hint: sum of atomic steps$)(5$ pts$)$:

b$)(10$ pts$)$ Draw the first three levels $($including the root$)$ of a recursive tree for this function. Each

node should include T$(.).$