Let us consider the binary trees below. B B D E D c) d) Select all that apply: O a. Tree in c) will not have the AVL (height-balanced 1-tree) property, if a right child is added to node B O b. For tree d), if we remove both nodes E and F, then the tree will have the AVL property. c. For a binary tree that does have the AVL property. If the property is violated after inserting one node, then the property can be restored using an algorithm (based on rotations) that runs in O(N3) time cost (where N is the number of nodes). d. Tree in d) will have the AVL property if we add a left child and a right child to node C O e. Tree in c) will not have the AVL property, if a right child is added to node B