1. Count the polynomial hash value for "specifications" with A=17 and N=931663099 What is the hash value with Java hashCode()? Why is it different? Find two different strings with same hash value. 2. You have 109 hats numbered from 1,2,,109. At first each hat is empty. Create class hatsAndBalls with following methods: - AddBall(int x ) //adds ball to hat x - function howManyHasAtleastOne() // returns how many hats has at least one ball - function greatestAmount() // returns count of balls for hat that has the most of balls Use Javas HashMap here. 3. Create two algorithms about how to count how many different integers there are in integer array size n. Other has to based on HashSet and other you can choose freely. Compare their time effectiveness and submit your results in comments. Test with arrays of size 1000,100000 and 1000000. Use random to add integers to array