Consider the following binary tree. Print out the nodes in the following orders $(10$ points$)$:

a$.$ Traverse the tree in preorder $(2$ points$)$

b$.$ Traverse the tree in inorder $(2$ points$)$

c$.$ Traverse the tree in postorder $(2$ points$)$

d$.$ How many internal nodes are there? $(1$ point$)$

e$.$ What is the maximum width of the tree? $(1$ point$)$

f$.$ What is the height of the tree? $(1$ point$)$

g$.$ What is the diameter of the tree?