finish part B Part A$.[4$ mark$]$ Header Encoding

Write a program that reads a line of printable characters and encodes with a sequence of keys with each key is a binary string of $\text{'}0\text{'}$s and $\text{'}1\text{'}$s$.$ The sequence of keys starts with one key with length $1,$ followed by three keys with length $2,$ seven keys of length $3,$ fifteen keys of length $4,$ etc. The keys of the same length are in sequence of its binary value but not with all $\text{'}1\text{'}$s$.$

The encoding scheme is as follows.

Assume the input header is: $\backslash (\backslash$mathbf$\{$n$\}(\backslash$mathbf$\{$X$\}+\backslash$# $\backslash$mathbf$\{\backslash$$ $90\backslash "?...\}\backslash )$

key string:

To verify the correctness of the encoding, write a function to read in a character and print the key$($s$)$ of that character.

Notes:

$1.$ You may not know the length of the header in advance.

$2.$ The maximum length of the key string is seven. That is$,$ the longest key string is $"1111110".$ Hint: A character string should have a $\text{'}\backslash (\backslash$backslash $0\backslash )\text{'}$ at the end of the string.

$3.$ The header contains only printable characters including "space", i$.$e$.$ any characters in the ASCII Table with values from $32$ to $126.$

$4.$ We assume the input is valid, i$.$e$.,$ no need to check the correctness of input.

$5.$ The header may have repeated characters that lead to different keys.

Sample Input and Output

Example $1$

Enter Header:

n$($X$+\backslash$# $\backslash$$$90)"?$

Enter character:

$\backslash$$

$010$

Example $2$

Enter Header:

n$($X$+\backslash$# $\backslash$$$90)"?$n

Enter character:

Example $3$ Part B$.[4$ marks$]$ Message Decoding

Extend your program in Part A to decode a message based on the keys generated in Part A$.$ The encoded message is a sequence of binary digits. The message should be decoded in segments. Each segment starts with the first $3$ digits to represent the length of keys to be decoded in the subsequent digits. The end of each segment is signified by a sequence of $\text{'}1\text{'}$s of that length.

With the example header in Part A$,$ the segment would be decoded as follows.

The message may have multiple segments and ends with the binary string $"000".$

Example $1$: message $010010011(1$ segment$)\backslash (\backslash$rightarrow $\backslash )$ decoded message $\backslash (\backslash$mathbf$\{$X $(\}\backslash )$

Example $2$: message $1000100111(2$ segments$)\backslash (\backslash$rightarrow $\backslash )$ decoded message $\backslash$#$\backslash$$$9$n

Your program should read in the header and an encoded message; then decode the message and output the decoded message.

Notes:

$1.$ Refer to the Notes of Part A$.$

$2.$ The encoded message is assumed to be in one line.

$3.$ We assume the input is valid.

Sample Input and Output

Example $1$

Enter Header:

n$($X$+\backslash$# $\backslash$$$90\backslash "?$

Enter message:

$\backslash [$

$\backslash$begin$\{$array$\}\{$l$\}$

$011000001011111001010111101110100111000\backslash \backslash$

$\backslash$text $\{\backslash$# $9$n$"$X $\}$

$\backslash$end$\{$array$\}$

$\backslash ]$

Example $2$

Enter Header:

:$-+$ IkC

Enter message:

$\backslash [$

$\backslash$begin$\{$array$\}\{$l$\}$

$011010111010010111000\backslash \backslash$

$\backslash$text $\{$ C$++\}$

$\backslash$end$\{$array$\}$

$\backslash ]$

Example $3$

Enter Header:

$=>?$@A pqrstuv $!"\backslash$#$\backslash$$EFSTCabgh$673$rs$-./01$cde$92$ieo$83$r

Enter message:

$100101110011111101011111010001010010011111101100111110110000111110111011111000010$

$110000101110111110110101011011111110011001111011110111100001011111010101110010111$

$11100000011111011010111111011101111101100011111110000111111000$

CS$2310$ is a great course!

Example $4$

Enter Header:

giOAstd!$2..$mt$-$e$+$n

Enter message:

$0101011011000000111010001100101100010100000011010100011111011100111000$

Assignment$2$