You are given the following binary tree. State the order in which the nodes will be traversed when using preorder, postorder, inorder, and level-order traversal algorithms. (b) (4 points) Using pseudocode, write a new method called T. leaf Count () for the linked- based Binary Tree that returns the number of leaves in a tree T. It should run in O(n) time. You may use existing methods such as isLeaf (v), left (v) etc. (c) (4 points) For the following tree, print the arithmetic expression making sure to include parenthesis where needed: 3 5 (d) (4 points) Draw the binary tree representation of the following expression: (((5+2)+(2-1))/((2+9) + ((7-2)-1)) *8)