1. Design and implement a program that compares the use of linear probing, quadratic probing, and double hashing on a collection of string keys of varying lengths. The program should extract a collection of strings from a text file and compute the average number of collisions and the average number of probes.
2. Implement the Color Histogram ADT using the 2-D array of chains as described in the chapter.