Let T be a binary search tree (BST) with n keys. Select all the statements below which are TRUE. If T is a perfectly balanced BST (all leaves have the same depth) and T has height 5, then T has 32 leaves. INORDER-TREE-WALK(T middot root) prints the keys in monotonically increasing order. The height of T is O(log_2n). TREE-INSERT, TREE-DELETE, and TREE-SEARCH have the worst-case running time O(n)