Let T be a Binary Search Tree (BST) with n keys. Select all the statements below which are TRUE. A tree is balanced if all the leaves have the same depth. The height of a balanced BST T is O (Ig n) If the BST T has height 3, then the maximum number of nodes in T is 16 For any node x, if y is a node in the right subtree of x,and z is a node in the left subtree of x, then y.key s z.key O TREE-SUCCESSOR, TREE-SEARCH, and TREE-MINIMUM have the worst-case running time ? (n). O The first element printed by the POSTORDER-TREE-WALK(?.root) is the smallest key of T TREE-DELETE, TREE-TRANSPLANT, and TREE-INSERT have the worst-case running time ? (A). O The worst-case complexity of the height of a BST T is ? (n)