Implement a Hash Table data structure in Assembly Language. The hash table will store key $/$ value pairs

using a hash on the key. The hash table should not allow duplicate keys but should allow duplicate

values. The keys and values will all be null$-$terminated strings.

Your hash table should use a simple hash function that will add the numeric values of all the letters in

the Key, and then modulo the sum to the hash size. The hash size will be initialized during the call to

HT$\_$Create but may grow as needed $($See HT$\_$Insert below$).$

The hash table should assume that the memory allocated for the Keys and Values by the calling program

will be persistent. It does not need to create copies of the values but may just retain pointers to both

values.

The only function below that should actually output anything directly to the screen is HT$\_$Print. All the

other functions must operate on the hash table but not print any output.

Your program must support the following interface methods