$8$ points Consider a binary search tree $T$ with $5$ nodes.

$($a$)$ What is whe maximum possiine depth of $T?$

$($b$)$ What is the mimmum possible depth of T$?$

$($c$)$ Whal are the migimun munuber of leaves $T$ can lixve?

$($d$)$ What are the naximum number of leaves I can lrave?