if you can only answer one question b or c would be best appreciated. thank you.

2. (12 points) Consider a recursion tree that looks like this: (ru/2) (ru/2) (ru/2) (ru/4) (in/4) (in/4) ( 4) (in/4) (in/4) (m/4) (z4)_(ru/4) a). What recurrence relation could generate this recursion tree? - b). How many levels would there be in this tree, as a function of n? c). How many leaves would there be in this tree, as a function of n