3. (15 points) Consider a binary tree T which has a maximum of 63 nodes (a) (2 points) What is the height of T? (b) (2 points) What is the minimum number of leaves of T? (c) (2 points) What is the maxmum number of leaves of T? (d) (4 points) Draw a skew tree that satifies all of the above properties. (e) (5 points) Draw a balanced binary tree that is not a full binary tree but satisfies all of the above properties