Question Which of the following statements about balanced search trees are true? Unless otherwise specified, assume that the 2-3 tree and red-black BSTS are as described in lecture (e.g., 2-3 trees...

Extracted text: Question Which of the following statements about balanced search trees are true? Unless otherwise specified, assume that the 2-3 tree and red-black BSTS are as described in lecture (e.g., 2-3 trees are perfectly balanced and red-black BST are left-leaning red-black BSTS with internal links colored either red or black). Answer Mark all that apply. O The minimum height of any 2-3 tree containing n keys is - log_3 n. UThe subtree rooted at any node of a 2-3 tree is itself a 2-3 tree. OThe number of structurally different (with respect to tree shape and link colors) red-black BSTS containing 4 keys is 2 OThe height of any red-black BST equals the height of the corresponding 2-3 tree plus the maximum number of 3-nodes on any path from the root to a leaf node. OFor any sequence of n >1 keys inserted into an initially empty red-black BST, the resulting red-black BST has at least one red link.