Racket Programming

In this project, you will write a spell checker generator that allows the ex perimentation with different sets of hash functions and their ranges. Racket is a language well suited for "rapid prototyping", i.e., allows a quick imple- mentation of a working prototype. We will represent a bitvector in Racket as a list of indices, i.e., a list of integer values for which the bitvector entry is l' (e.g. vector [0 010 100 is represented as list '(2 4) the indexing is 0-based). This is a typical representation of a bitvector where '1' entries are sparse, i.e., where there are many more .0' entries than '1' entries 1 Hash Functions Our hash functions consist of two main steps. In the first step, the input word w is mapped to an integer value, called its key. In the second step, the key is mapped to its final hash value. We will compute w's key by associating an integer value with each letter (symbol) in w, and then multiplying the resulting values. Note: In this project we only consider lower case letters and words We will use the following key function key(w)-please note that we are using pseudocode for functions here rather than the Racket's function nota- tion: key