1. (a) (5 points) What is the minimum and maximum height of a full binaryr tree with 31 vertices? Justify your answers. {b} (5 pointe) Drew an example of a full m-ary tree with 24 leaves and height 3, where m is a positive integer, or show that no such tree exists. 2. Consider the rooted tree shown below. (a) (5 points) Write the verticee in the order visited by a preorder traversal. (b) (5 points) Write the vertices in the order visited by a postrorder traversal