For this assignment, you will declare an array that can hold up to 10 elements. the elements will be read from a file. use the modulo-division to come up with a location. if there is a collision, then use double hashing. the formula that you should use for double hashing should be the same as the example provided in the notes. if there is still a collision, then use quadratic probing from the point of the second collision forward three times. if you are still colliding, use linear probing. at the end of each insert, display the number of collisions. also, allow the user to search for a value by prompting the user. use the same set of hash functions to look for the item. if the item has not been found, then display not in the list.