Let us consider the binary trees below.ABDa$)$b$)$Select one or more:a$.$ Tree in b$)$ does not have the AVt. property.b$.$ For tree a$),$ if we add a left child to node D$.$ then the tree does no longer have the AVL property.c$.$ For tree a$),$ if we add a right child to node C$,$ then the tree does no longer have the AVL. property.d$.$ Trees in a$)$ and b$)$ have the AVL $($height$-$balanced $1-$tree$)$ propertye. Given a binary tree that does have the AVL property. If the property is violated after deleting a node, then the property can be restored using an algorithm $($based on rotations$)$ that runs in exponential time $($O$(2)$ where N is the number of nodes$)$