Selection of written questions--choice questions

1.

Suppose that a communication message consists of only 6 letters ABCDEF, and the letters appear in the message in the frequency of 2,3,7,15,4,6. Based on these frequencies as weights, Huffman coding is constructed, and the length of the Huffman tree-weighted path and the Huffman code of the letter B respectively are ___. (This assumes that the value of the left node is less than the value of the right node)

86,1011;70,1000;86,0001;70,0010;92,1000;92,0100

2 The following questions about P, NP and NPC are wrong if a problem can find an algorithm that can solve it in polynomial time, So this problem belongs to P problem NP problem is that can be in polynomial time to verify a solution problem all P-class problems are NP problem NPC question is not necessarily a NP problem, as long as all the NP problem can be reduced to it

Selection of written questions--choice questions