hurry up pleasee

C) Itemset 12, Section Two. True/ False Problem Set (1+10-10%) For each question, please read the statement and decide whether it is true or J. Ifit is wrong, with false. Jfi is te, mark it with mark it with X.Write your answer on the answer sheet. 10 1) 17 is a prime number. 2) Huffiman encoding is a kind of fixed-length encoding. 3) O(nlogn) is the lower bound for searching. 4) The brute-force approach for traveling salesman problem takes O(n!) time. 5) The multiplication order of matrix makes no difference in the running tim 6) Dijkstra's algorthm is able to solve the problem of shortest paths in the presence of ne ?) The product of two complex numbers can be done with no less than four rea e. ) Some prime numbers can't pass primality test )For any graph, the Depth-first search and Breadth-first search results will be the sin ) The two nodes with the biggest frequencies must be at the bottom of the Hufman will be the same. tree