Were given n points p1 = (x1, y1), p2 = (x2, y2), ...,pn = (xn, yn) on plane; all coordinates are integers. We would like to know if there are any two points on the same vertical line or horizontal line. Give a linear time algorithm using hashing we assume that insert and search operations take O(1) time each.