Question $7(1$ point$)$

You must implement a sorting algorithm to sort log error file in a large busy server by

time. This sorting task is done at night when there is little activity. The nature of log

error files is that they should theoretically be sorted by time, but this cannot be

guarantee since the server may prioritize other tasks over error reporting. Which

sorting algorithm is best to use in this case

Heap Sort

Merge Sort

None of the answers are correct

Radix Sort

Quick Sort

Question $8(1$ point$)$

Consider an alphabet containing only the following $5$ characters, with the given

frequencies:

A Huffman tree was constructed with the following rules. When pairing $2$ items, the

one with the smaller frequency goes on the left. The left edge has label $1,$ and the

right edge has a label $0.$ If two items with the SAME frequency are being paired, then

this is how you must determine which one goes on the left:

if both items are characters in the alphabet above, then the one that is

smaller, in alphabetical order, as given above, goes on the left.

if one is a character of the alphabet, and the other is a created node, then the

character goes on the left

if both are created nodes, then the one was the one created first goes on the

left.

Use the Huffman tree to encode the word RESEAT

None of the other answers are correct

$01100011011000$

$01100001011001$

$10011110100110$

$10011100100111$