Let us consider the binary trees below. 1 B D E b) Select all that apply: O a. Tree in b) will not have the AVL property, if a right child is added to node A. O b. For tree a), if we remove node D, then the tree does no longer have the AVL property. O 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 constant time cost. O d. Both trees a) and b) have the AVL (height-balanced 1-tree) property. e. For tree a), if we remove node C, then the tree does no longer have the AVL property