(e) (2 marks) A free tree is shown below. Select the root node which would result in a rooted tree of the minimum height. If this root note is selected, how many leaves are there in the rooted tree? m 2 (f) (2 marks) A binary tree is a rooted tree where every node has at most two children. What is the maximum number of non-leaf nodes in a binary tree of height 5? (g) (1 mark) If a forest has 1010 nodes and 6 connected components, how many edges does it have?