Write a program in C language to generate Huffman coding for the following Text given:

ADAM IS IN MADAMS KITCHEN

$($make sure the output is in the exact same order as shown in the testcase in results$)$ Here i have given the eqivalent program in : import heapq

import collections

def huffman$\_$coding$($text$)$:

# Frequency of each character

frequency $=$ collections.Counter$($text$)$

# Priority queue to hold the characters and their frequencies

priority$\_$queue $=[[$weight$,[$symbol$,""]]$ for symbol, weight in frequency.items$()]$

heapq.heapify$($priority$\_$queue$)$

# Tree construction

while len$($priority$\_$queue$)>1$:

low $=$ heapq.heappop$($priority$\_$queue$)$

high $=$ heapq.heappop$($priority$\_$queue$)$

for pair in low$[1$:$]$:

pair$[1]=\text{'}0\text{'}+$ pair$[1]$

for pair in high$[1$:$]$:

pair$[1]=\text{'}1\text{'}+$ pair$[1]$

heapq.heappush$($priority$\_$queue, $[$low$[0]+$ high$[0]]+$ low$[1$:$]+$ high$[1$:$])$

# Generating Huffman codes

huffman$\_$codes $=\{\}$

for pair in heapq.heappop$($priority$\_$queue$)[1$:$]$:

huffman$\_$codes$[$pair$[0]]=$ pair$[1]$

return frequency, huffman$\_$codes

text $=$ "ADAM IS IN MADAMS KITCHEN"

frequency, huffman$\_$codes $=$ huffman$\_$coding$($text$.$replace$("",""))$

print$("$FREQUENCY OF ALPHABETS"$)$

specific$\_$order $=[\text{'}$A$\text{'},\text{'}$M$\text{'},\text{'}$I$\text{'},\text{'}$D$\text{'},\text{'}$S$\text{'},\text{'}$N$\text{'},\text{'}$K$\text{'},\text{'}$T$\text{'},\text{'}$C$\text{'},\text{'}$H$\text{'},\text{'}$E$\text{'}]$

for char in specific$\_$order:

if char in frequency:

print$($f$"\{$char$\}-\{$frequency$[$char$]\}")$

print$("$HUFFMAN CODE IS$")$

for char, code in sorted$($huffman$\_$codes.items$(),$ key$=$lambda x: $(-$len$($x$[1]),$ x$[1]))$:

print$($f$"\{$char$\}-\{$code$\}")$