please???? time ????????

Question 31 Not yet answered Marked out of 1.00 The Huffman codes provide a method of encoding data inefficiently when coded using ASCII standard. Select one: O True Flag question O False Question 32 Not yet answered When inserting a new entry into a red-black tree, the newly created node will be: Marked out of 1.00 Select one: P Flag question a. red, if the new node is the root node b. the same color as its sibling C. red, if the new node is not the root node O d. black, if the new node is not the root node