dont use chat gpt$-$ Problem $1$: The Decoding Ta

ble

Write a C program in main $.$ c in directory unzipper that will be compiled into an executable unzip$-$

per. Your program will read in a series of bytes in hexadecimal notation, representing the decoding table

needed to decompress a piece of compressed text.

Input

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. For Problem $1,$ these four bytes are

$0,$ indicating there is no compressed data to follow. In Problem $2,$

these four bytes will not be all $0$ s$.$

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$).$ For the hexadecimal, use the format specifier with

$8x.$ On the right is an example of a table for encoding the string

"Hello World!

$",$ Observe that in this case the encodings for the

characters are between $2$ and $4$ bits long instead of the full $8$ bits per

byte.

Processing

Your program will need to read in the table and output it in a human$-$

readable form.

The decoding table will have at most $256$ entries. $($Use an array

of structs to store the table, as it will be needed for Problem $2.)$

For each entry, read in the $3$ bytes and interpret the $24-$bit bit$-$

stream as described above.

The encoding of each character will be at most $12$ bits. Any extra bits can be ignored.

Output

All output should be performed to stdout. The output must be exactly as specified. The output consists

of $T$ lines, one line per entry in the table. Each line should be terminated by a new$-$line character. The

entries should be displayed in the same order as the input.

Each entry has the following format:

$C$:$L{E}_2$

where

$C$ is the character in hexadecimal using the format $"0x82\mathrm{.}2x"$

$L$ is a decimal integer, using the format $"8d"$

$E_2$ is the binary representation of the encoding, it should be exactly $L$ characters $(0$ s and $\{$:$1(s))$ long.

Examples

Input $($Ex $1)$ Output $($Ex $1)$ Input $($Ex $2)$ Output $($Ex $2)$

input$($Ex $1)$

$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$00$

Output$($Ex$1)$

$0$x$21$ : $3000$

$0$x$57$ : $40010$

$0$x$48$ : $40011$

$0$x$6$c : $201$

$0$x$6$f : $3100$

$0$x$0$a : $3101$

$0$x$65$ : $41100$

$0$x$64$ : $41101$

$0$x$20$ : $41110$

$0$x$72$ : $41111$

Input$($Ex$2)$

$0$x$0$d

$0$x$6$b $0$x$100$x$00$

$0$x$6$a $0$x$280$x$00$

$0$x$690$x$3$c $0$x$00$

$0$x$680$x$4$e $0$x$00$

$0$x$670$x$5$f $0$x$00$

$0$x$0$a $0$x$6$f $0$x$80$

$0$x$780$xcf $0$xc$0$

$0$x$610$xcf $0$xc$1$

$0$x$620$xbf $0$xc$2$

$0$x$630$xaf $0$xc$4$

$0$x$640$x$9$f $0$xc$8$

$0$x$650$x$8$f $0$xd$0$

$0$x$660$x$7$f $0$xe$0$

$0$x$000$x$000$x$000$x$00$

Output$($Ex$2)$

$0$x$6$b : $10$

$0$x$6$a : $210$

$0$x$69$ : $3110$

$0$x$68$ : $41110$

$0$x$67$ : $511110$

$0$x$0$a : $6111110$

$0$x$78$ : $12111111000000$

$0$x$61$ : $12111111000001$

$0$x$62$ : $1111111100001$

$0$x$63$ : $101111110001$

$0$x$64$ : $9111111001$

$0$x$65$ : $811111101$

$0$x$66$ : $71111111$