Select all that apply: a. Printing the expression tree, in any of the 3 notations, is O(NlogN) where N is the number of nodes b. Evaluating the expression costs O(N) c. Printing the expression in postfix form can include brackets d. Building the expression tree from infirx notation costs O(N) e. Printing the expression tree, in any of the 3 notations, is O(2N) where N is the number of nodes Select all that apply: a. For a binary tree that does have the AVL properly. 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(2N) where N is the number of nodes). b. Tree in b) does not have the AVL property. c. For tree a), if we add a left child to node D, then the tree does no longer have the AVL property. d. Tree in a) has the AVL (height-balanced 1-tree) property e. For tree a), if we add a right child to node C, then the tree does no longer have the AVL property