Let us consider the binary trees below.

e$)$

f$)$

Time left $0$:$43$:$52$

Select one or more:

a$.$ Tree in f$)$ will not have the AVL property, if a right child is added to node $C.$

b$.$ Tree in e$)$ does not have the AVL property

c$.$ Tree in f$)$ will not have the AVL $($height$-$balanced $1-$tree$)$ property, if a right

child is added to node B

d$.$ Tree in e$)$ will have the AVL property, if we add a right child to node $C.$

$(8.)$ Tree in f$)$ will not have the AVL property, if a right child is added to node $B.$