Code in C: Your program will read its input from stdin. The first line contains a single byte denoting the number of

entries T in the decoding table. This byte is to be interpreted as an unsigned integer. If T is $0,$ then it is to

be interpreted as $256.$ This is followed by T lines, each encoding a table entry and consisting of three

items: the character, C$,$ that is encoded; the length, L$,($in bits$)$ of the

encoding; and the encoding, E$,$ which is bit sequence of L bits. After

the table entries there are four bytes encoding the length of the com$-$

pressed bitstream to be decoded.Each entry is encoded as a three byte $(24-$bit$)$ bitstream, where the bits

in each byte are ordered most$-$significant $($first bit$)$ to least significant

$($last bit$).$ The first $8$ bits encode the character $($C$).$ The next $4$ bits en$-$

code length, L $($an unsigned integer$),$ and the first L bits of the remain$-$

ing $12$ bits are the compressed encoding E$,$ of character C$.$ The three

bytes are encoded in the input in hexadecimal. $($Hint: Use scanf to

read the bytes$).$ the four bytes after the table encode an integer,

N$,$ in big endian byte order, denoting the number of compressed characters encoded in the bitstream that

follows. The rest of the input consists of zero or more bytes $($in hexadecimal representation$)$ encoding a

bitstream, using the same bit order as the encoding of the table. For convenience, no line will be longer

than $60$ characters, but it is recommended to simply read in one byte at a time as the bitstream is being

decoded.If N is not $0,$ do not output the decoding table as described in Problem $1,$ and output the text from

the decompressed bitstream instead.

$$ To decompress a character from the bitstream:

o Start with an encoding D of length $0(0$ bits$)$

o In a loop $($Note: D can be at most $12$ bits long$)$

$$ Add the next bit from the bitstream to D

$$ Search the table for encoding D$.$ Both bit pattern and length must match

$$ If found, break

o Output corresponding character C$.$

$$ Once the expected number of characters is

decoded, stop.

$$ All encodings are prefix free, meaning that no

encoding is a prefix of another encoding.

Output

Same output format as for Problem $1$ if the N is $0,$ oth$-$

erwise, output the decompressed text. $($See example.$)$

Example

Input Output $=$ Hello World!

$0$x$0$a

$0$x$210$x$300$x$00$

$0$x$570$x$420$x$00$

$0$x$480$x$430$x$00$

$0$x$6$c $0$x$240$x$00$

$0$x$6$f $0$x$380$x$00$

$0$x$0$a $0$x$3$a $0$x$00$

$0$x$650$x$4$c $0$x$00$

$0$x$640$x$4$d $0$x$00$

$0$x$200$x$4$e $0$x$00$

$0$x$720$x$4$f $0$x$00$

$0$x$000$x$000$x$000$x$0$e

$0$x$3$c $0$x$590$xc$50$x$3$d $0$xd$10$x$68$

Hello World!

i am having trouble in processing the last line hexadecimals. we are to store all binary conversions into one array and then parse it$.$ when printing using printBinary, it prints one bit at a time. I need to store the bits into an unsigned short.