this is all one question

Three-way search trees aka 2-3 trees: The typical implementation of a (2-3) tree uses a three-way search tree where each node has space for 2 keys and 3 child pointers. Furthermore, all leaves are at the same level. Please use the notation (x -) for a single node with one key and (x x) for a single node with 2 keys when answering the following questions. 2.6 Draw a valid (2-3) tree with four levels containing the mimimum number of keys. 2.7 Draw a valid (2-3) tree with three levels containing the maximum number of keys. 2.8 Write an expression for minimum number of nodes in a (2-3) tree with p levels. 2.9 Write an expression for the maximum number of keys in a (2-3) tree with q levels. 2.10 Give an example of a valid (2,3) tree that must grow in height to handle a newly inserted key. Show a before and after diagram