Quick please

(a) True or False. All binary search trees' branching factor must be 2. TODO: write your answer below (True/False) [2 marks] (b) Given that a binary tree's height is 9. What are the minimum and maximum numbers of nodes that this tree can have? Each answer must be a simple number (i.e., not a formula). Use your Python console as a calculator if needed. Note: recall that the height of a tree is defined by counting _nodes_ instead of edges. TODO: write your answer below. The minimum number of nodes possible: [2 marks] TODO: Write your answer below. The maximum number of nodes possible: [2 marks] (c) The following is the _preorder_ traversal of a Binary Search Tree: 18, 16, 13, 15, 19, 24, 22, 23 What is the size (number of nodes) of the subtree whose root is 16? You may answer "unknown" if the answer cannot be determined. TODO: Write your answer below. The size of the subtree rooted at 16 is [2 marks]