Your assignment is to write an ARM assembler code to:

$1.$ Read in a given Text file containing only letters, periods, and spaces. Perform a histogram analysis of the characters to determine the frequency of occurrences and generate the Huffman code as described. When

$2.$ Given an encoded transmitted message, in which the bits are compacted into several $4-$byte unsigned integers, decode and print out the original text message.

$3.$ Please provide a Makefile as part of your build.

Example:

For the example above, the secret message would fit into a single $4-$byte memory location as:

$11100100010010100110000000000000$

Note the $13$ trailing $0$s at the end of the message. You can encode the end of each $4-$byte memory location with a bunch of spaces if you want, or you can define an extra character in addition to the letters, period, and spaces to encode an end$-$of$-$memory character to mark the end of a $4-$byte memory block. The design is up to you. There's no problem with printing out a few spaces between letters.

Your decode.s function should take in as input a linked list of $4-$byte unsigned integers containing the secret message:

$-$ decode$($r$0)-$ where r$0$ contains the address of the first node of the linked list

where

r$0-->$node$1-->$node$2-->$node$3-->$NULL

node$1$: $10101101010101010101010001110010-->10101101010101010101010001110010-->10101101010101010101010001110010-->$ NULL

so if a binary code does not fit in at the end of a node, it will continue on into the next node so that there is no wasted bit.