Problem 2 [1 pt]. Do Problem 13.1-6 in textbook CLRS (page 335). What is the largest possible number of internal nodes in a red-black tree with black height k? What is the smallest number? Note: The definition of black height is on page 332. The number of black nodes includes the NIL leaf nodes, which are black; if the tree is empty of real nodes (these are the internal nodes), then the root is a NIL node. Thus, if a tree is empty of real nodes then it has exactly one NIL node, which is black, and the black height is 1