Let T be a Binary Search Tree (BST) with n keys. Select all the statements below which are TRUE. O For any node x, if y is a node in the right subtree of x, then y.key s x.key. O If T is a perfectly balanced BST (all leaves have the same depth) and T has height 6, then T has 64 leaves. The worst-case complexity of the height of a BST T is O(n). The height of a balanced BST T is O(lgn). A tree is balanced if all the leaves have the same depth. O TREE-DELETE, TREE-TRANSPLANT, and TREE-INSERT have the worst-case running time O(h). TREE-SUCCESOR, TREE-PREDECESOR, and TREE-MAXIMUM have the worst-case running time O(n). INORDER-TREE-WALK(T.root) prints the keys in monotonically decreasing order