i need all answer. make sure the answer are 100% correct.thanks

True-or-False 6 A. Multiple-Choice - 1 6 fn Code-Completion 4 > Programming 1 (2 point(s)) 2-1 Construct a Huffman tree from four leaf nodes with weights 9, 2,5 and 7. Then the weighted path length of this Huffman tree is: Author DS Organization It O A. 23 O B. 37 O C. 44 OD. 46 (3 point(s)) 2-2 Given a set of characters { a, b, c, d, e, f} with their occurrence frequencies being {6, 3, 8, 2, 10,4}, respectively. Which of the following is a correct set of the corresponding Huffman codes? Author Organization I O A. 00, 1011, 01, 1010, 11, 100 OB. 00, 100, 110, 000, 0010, 01 O C. 10, 1011, 11, 0011, 00, 010 OD. 0011, 10, 11, 0010, 01, 000 (3 point(s)) Author # 2-3 Suppose that the size of a hash table is 11, and the hash function is H(key)=key%11. The following 4 elements have been inserted into the table as Addr(14)=3, Addr(38)=5, Addr(61)=6, Addr(86)=9. When open addressing with quadratic probing is used to solve collisions, the address of the element with key=60 Organization I will be O A. 5 OB. 7 O C. 8 OD. 10 2-4 To list the directory in a hierarchical file system with the format of files that are of depth di will have their (3 point(s)) names indented by di tabs, which of the following traversals is the most suitable one. Author Organization It* O A. pre-order O B. in-order O C. post-order OD. level-order (2 point(s)) 2-5 Given the shape of a binary tree shown by the figure below. If its inorder traversal sequence is {D, E, A, B, F, H, C, G }, then the node on the same level of H must be: Author Organization It O A. E and G O B. B O C. E OD. A and G (2 point(s)) 2-6 Given the popping sequence of a stack as { 1, 2, 3, 4, 5, 6}. Among the following, the impossible pushing sequence is: Author Organization I O A. 3 2 1 6 54 OB. 651234 O C. 654123 OD. 465132 Activate Windows