Implement the map abstract data type whose specifications appear below and use it to: implement a rudimentary spelling checker, implement a program that checks anagrams, implement a program that finds words which occur the same number of times in two text files, The specification for the interface to the map module is given in the map.h file. You must make and justify all design decisions for your implementation, based on the following important requirements: We will test your map implementation under the assumption that its interface is as described in map.h. Thus, you must not change the interface specification. You must implement the map, test it appropriately, and then report your effort in a test report (see below). Binary Search Trees are not allowed (not that they are bad). You must use some kind of a hash table as it is a very powerful tool for searching. Implement the programs described below.
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.