Select one or more: aFor binary tree that does have the AVL property. M the property is violated atterdeleting a node, then the property can be restored using an algorithm $($based onrotations$).$ that runs in exponential time $($O$(2$Ny where N is the number of nodes$).$b$.$ Tree in a$)$ has the AVL $($height$-$balanced $1-$tree$)$ propertyc. For tree a$),$ if we add a left child to node D$,$ then the tree does no longer have theAVL property.d$.$For tree a$),$ if we add a right child to node C then the tree does no longer have theAVL property.e$.$Tree in b$)$ does not have the AVL property.