[ Read the following questions carefully and choose the right answer. ]

What is the time complexity of Huffman Coding ?

A O(N)

B O(N log N)

C O(N (logN)^Λ2)