Question $4[1$ pt$]$: Answer the following questions for the binary search tree shown on the right:

a$)$ Is the tree balanced? $($Briefly describe why$)$

b$)$ If we delete node $45($without performing rotations$)$ is the

result a balanced? $($show the tree after deletion and briefly

describe why the tree is $($or not$)$ balanced$)$

c$)$ If we delete node $50($without performing rotations$)$ is the

result a balanced tree? $($show the tree after deletion and

briefly describe why the tree is $($or not$)$ balanced$)**$ The

delete operations are cumulative $(45$ is no longer in the tree$)$

a$)$