Suppose we want to store each of the elements of a matrix (rows and columns) using a hash map. In this Map, the Coordinate is the key and the matrix element is the value. 2. class Coordinate int row int col; // example matrix Map matrix = new HashMap()(); matrix.put (new Coord (e,e), 1); matrix.put (new Coord (e,1), matrix . put(new Coord (1,0), e); matrix , put(new Coord (1,1), e); 4); Are each of the following hash codes good or bad, and why? a) int hashCode (Coordinate c) f return c.row+c.col;) b) int hashCode(Coordinate c) return random()(c.row+c.col); Write a better hash code for Coordinates. int hashCode(Coordinate c)(