III. Fill in the Blank (total 10 points, 2 point for each blank) (1) Given the Inorder traversal: D B F E A G C L J H K and Preorder traversal: A B D E F C G H J L K, please write Postorder traversal: (2) Using the selection sort algorithm, manually sort the following list: 7, 23, 31, 40, 56, 78, 9,2 and show your work in second pass: (3) An element at position i in the array has its parent stored at position (4) Nodes at the same level that share the same parent are called (5) traversal algorithm is used to extract a infix notation from an expression tree. IV. Questions and answers (20 points) (1) Can you use an example to show how selection sort works? (10 points) (2) Can you write your understanding of Prim algorithm? ( 10 points) V. Program design ( 30 points) (1) Write a recursive implementation of Preorder, inorder and postorder traversal for the binary tree