Consider the following binary search tree $T$ :

$($a$)$ Perform the left rotation left$-$rotate $(T,42)$ and draw the resulting binary search tree.

$($b$)$ Perform the right rotation right$-$rotate$(T,15)$ and draw the resulting binary search tree.