III. Fill in the Blank (total 20 points, 2 point for each blank) (1) Given the Inorder traversal: 4 2 6 5 1 7 3 11 9 8 10 and Preorder traversal: 1 2 4 5 6 3 7 8 9 11 10, please write Postorder traversal: and (2) Using the selection sort algorithm, manually sort the following list: 5, 23, 31, 40, 56, 68, 9, 3 and show your work in third pass: (3) The maximum number of edges for a undirected graph with 4 vertex is (4) An element at position i in the array has its left child stored at position its right child stored at position (5) In elements at every node will either be smaller than or equal to the elements at its left and right child. (6) Nodes at the same level that share the same parent are called (7) The height of a full binary tree with n nodes is (8) traversal algorithm is used to extract a prefix notation from an expression tree (9) Given a sequence data (46, 79.56, 38, 40,84), then the initial status of maximum heap during the heap sort is