coding java

The key is the street address. The value contains other information (e.g., name, zip code, age, etc.). Here is the hash function: h(street address) = numeric part of the address % table size ///Question 1 You have a table of size 11. The table uses open addressing and linear probing to resolve collisions. List five addresses and the hash code for each address. The addresses should have these characteristics: The addresses do not all hash to the same location. There are collisions. There is clustering. ///Question 11 Review the Student class provided with the files for this [login to view URL] the equals method and the hashCode method for this class. Note: Make sure you're using the homework version of student (with firstName, lastName, tuitionPaid, and gpa). Do not use the version from the lecture notes, which has fewer variables. Write both methods, including the complete method headers. ///Question 12 /Write a method to create a HashMap from a list of Employee objects. The method takes in a list of Employee objects. The method returns a HashMap that contains those employees hashed by their employee ID. The Employee class is contained in the downloads for this homework. The method header is: public static HashMap<String, Employee> getEmployeeHash(ArrayList<Employee> employeeList) ///Question 13 Write a method to retrieve Employee objects from a HashMap. The method takes in a HashMap that holds take in a HashMap that holds Employee objects hashed by their employee ID. The method also takes in a list of Employee IDs. Some IDs might be in the HashMap, others might not. Create a list of all Employee objects that match the IDs from the list and are eligible for a bonus. The Employee class is contained in the downloads for this homework. The method header is: public static ArrayList<Employee> getEmployeeBonusList(HashMap<String, Employee> employeeMap, ArrayList<String> employeeIDs)