a) Mark all the points that will collide with Point (1,2) public class point \{ public final int x,y; public Point(int x, int y){ Pois. x; this. y; public int hashcode() \{ } return this. x+ this. y; \} b) Assume Point (1,2) is put into an empty hash table with M=2 buckets using Point. hashcode. If two points are equal if and only if their x-values are equal, what would calling contains(Point (1,3)) on the hash table return? Explain your answer by explaining how contains uses both the hashCode and equals methods to search for objects