program 4b - cop3530 Data Structures and Algorithms Professor: Michael Robinson e-mail : michael.robinson@cs.fiu.edu 1 - Worth 4 points Create a hash table using the following data file http://users.cis.fiu.edu/~mrobi002/downloads/dataSample/dataSample As the key use each word found in the file, DO NOT have duplicate records As the value use the location where you found each word for the first time, so it will be : word, first location only. Create a map with the previous data Using the Value of the previous data as the Key of this new map and the Key of the previous data as the Value of this new map. MAKE SURE to create data files with the results. 2 - Worth 4 points Create a bucket sort using the following data 5, 4, 9, 0, 1, 0, 2, 3, 1, 4, 5, 9, 3, 0, 5 Write a file with the above data sorted Write two new sorted files using the previous file as input and - In the first file place all even numbers - In the second file place all odd numbers MAKE SURE to create data files with the results.