B) (20 marks) Binary tree traversals: Give the prefix, infix, and postfix expressions corresponding to the binary tree shown below. Write the prcorder, inorder and postorder traversals of the binary tree shown below A binary tree has a preorder traversal of ECDFKJMOGHILNPQ and an inorder traversal of CKFDMJOEHGLPNQI. What is its postorder traversal of this binary tre e? Given the following combinations, which one you can use to construct a unique binary tree? Ifa combination cannot be used to uniquely identify a binary tree, please give an example to show this. Combination I: preorder traversal sequence+inorder traversal sequence; Combination 2: preorder traversal sequence + postorder traversal sequence Combination 3: inorder traversal sequence+post order traversal sequence. C) (10 marks) Binary search trees: Draw a binary search tree which is built from the data which insertion order is 42, 12, 8, 30, 15, 25,53, 9. 66,70, 50, 1 *Show the result of removing the root from the binary tree shown below. Show the result of removing the node 12 from the binary tree shown below. Show the result of removing the node 16 from the binary tree shown below. 42 12 53 16 51 60 57 (65 19