The runtime of the Huffman trie construction algorithm using a sorted array to store the forest is: $($nn is the number of unique characters in the file to be compressed$)$

The following multiple$-$choice options contain math elements, so you may need to read them in your screen reader's $$reading$$ or $$browse$$ mode instead of $$forms$$ or $$focus$$ mode.

Choice $1$ of $4$:$($n$)($n$)$Choice $2$ of $4$:$($log$($log n$)$n$)$Choice $3$ of $4$:$($n$($n loglog n$)$n$)$Choice $4$ of $4$:$($n$2)($n$2)$