In a fully balanced (symmetric) binary search tree (BST) with n nodes, the root has rank . Given a BST that is a valid red-black tree, how extreme (e.g., how low) could the rank of the root be? Use -notation for your answer. Include a description or drawing of a tree that corresponds to your answer (explain how youre getting your answer).

a2 a2