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

True-or-False 6 A. Multiple-Choice - 16 fn Code-Completion 4 > Programming 1 (2 point(s)) 1-1 Given a Huffman tree for N > 2) characters, all with different weights. The weight of any non-leaf node must be no less than the weight of any node on the next lower level. Author DS Organization XIX OT OF 1-2 Let C be an alphabet in which each character c in C has frequency c.freq. If the size of C is n, the length of the (2 point(s)) optimal prefix code for any character c is not greater than n - 1. Author Organization I OT OF 1-3 To sort N records, heap sort requires at least O(N) extra space. (1 point(s)) Author DS Organization It OT OF 1-4 Kruskal's algorithm is to maintain a forest and to merge two trees into one at each stage. (1 point(s)) Author Organization *** OT OF (2 point(s)) 1-5 If the depth of an AVL tree with nodes { 1, 2, 3, 4 } is 3 (the depth of the root is 1), then it is possible for node 4 to be the root. Author Organization OT OF (2 point(s)) 1-6 Reviewing the randomized QuickSort in our course, we always select a central splitter as a pivot before recursions, make sure that each side contains at least n/4 elements. However, as the same as the deterministic QuickSort, the worst case running time of the randomized QuickSort is still O(N2). Author Organization I OT OF Activate Windows