The following is a string of ASCII characters whose bit patterns have been converted into hexadecimal for compactness: 73 F4 E5 76 E5 4A EF 62 73. Of the eight bits in each pair of digits, the leftmost is a parity bit. The remaining bits are the ASCII code. (a) Convert the string to bit form and decode the ASCII. (b) Determine the parity used: odd or even?

Fill in the empty spaces in the following table. As you do, please be aware of the following: • All numbers are considered signed (negative) for this table • All binary answers must have 16 bits • You need to put a space after every 4 bits for binary values. All hex values must use capital letters Signed Decimal 16-bit Binary Нех |-12 -20 1111 1111 1110 1100| FFEC 65495 1111 1111 1101 FFD7

Huffman Coding and Phrases Use the following chart to answer problems 15-19. 15. Calculate the total number of bits per character. Record your answers in the chart. Character Code Frequency Bits A 000 2 E 001 H 010 1 K 011 1 M 100 101 1 R 110 2 S 111 1 T 1000 4 U 1001 1 space 1010 4 What are the total bits in the original code? Use Huffman Coding to compress the following phrase: “MEET ME AT THE SUPERMARKET". Draw the Huffman Coding tree in the space provided below. Hint: You can use the Shape tool to draw the graph, or you can draw the graph by hand, then photograph or scan your graph to submit it.