You have been provided with the following table that describes a "Huffman Code" for compressing English text.

Encode the message "happy pride month" into a sequence of binary digits. Add extra zeros to the END of the message so it ends at a byte barrier $($if necessary$).$

$($a$)$ Provide your answer in Hex.

$($b$)$ Calculate the $\%$ compression you achieved, as compared to storing the message in a text file $($where each character would require one byte$).$ Briefly explain your calculation.

$\backslash$table$[[$Symbol$,$Huffman Code$],[[$space$],111],[$e$,010],[$t$,1101],[a,1011],[0,1001],[$i$,1000],[$n$,0111],[S,0011],[$h$,0010],[r,0001],[1,10101],[$d$,01101],[$c$,00001],[4,00000],[f,110011],[m,110010],[$w$,110001],[y,101001],[$P$,101000],[9,011001],[$b$,011000],[v,1100000],[k,11000011],[x,110000100],[$j$,1100001011],[9,11000010101],[z,11000010100]]$