Let us consider the binary trees below. B D E e) Select all that apply: O a. Tree in e) will have the AVL (height-balanced 1-tree) property, if node F is removed. O b. Tree in e) will have the AVL property, if we remove node D. O c. Tree in f) will not have the AVL property, if we remove node E. O d. Tree in e) will have the AVL property if we add a right child to node B. e. 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(N4), where N is the number of nodes