Greedy algo quiz ii

#1

Q9. Greedy9
What is the time complexity of Huffman Coding?

O(N)

O(NlogN)

O(N(logN)^2)

O(N^2)

given ans is O(N(logN)^2) but shouldnt it be O(NlogN)

#2

@snehacpcb_6a154f5c45187387 its wrong here