Consider the following binary tree. $(16$ points, $2$ points each$)$

a$)$ Traverse the tree preorder.

b$)$ Traverse the tree inorder.

c$)$ Traverse the tree postorder.

d$)$ How many internal nodes are there?

e$)$ How many leaves are there?

f$)$ What is the maximum width of the tree?

g$)$ What is the height of the tree?

h$)$ What is the diameter of the tree?