QUESTION 4) a) Draw the Binary Search Tree, after adding (in the given order) all of the following numbers to the tree. 13 34 27 83 43 55 72 26 12 17 23 15 10 41 35 90 42 11 30 b) Write the screen outputs for each of the traversal methods: Breadth-first, Preorder, Inorder, Postorder. c) Write the following recursive C function: int find_leaf_count (struct Node * P); P is input parameter (initially as the root). Function should calculate and return total count of all leaf nodes. d) Write the following recursive C function: int check_trees (struct Node * P, struct Node * Q ); P and Q are roots of two trees. Function should compare stuctures and data of both trees. If they are identical, then the function should return TRUE, otherwise should return FALSE.