Supply compatible hashCode and equals methods to the Student class described in Exercise ••• P15.2 . Test the hash code by adding Student objects to a hash set.

Data from exercise  P15.2 Reimplement Exercise •• E15.4 so that the keys of the map are objects of class Student. A student should have a first name, a last name, and a unique integer ID. For grade changes and removals, lookup should be by ID. The printout should be sorted by last name. If two students have the same last name, then use the first name as a tie breaker. If the first names are also identical, then use the integer ID. Use two maps.