| ||This problem contains images best viewed from the applet.
You are given several points on the plane. Nine points form a 3x3 subgrid if they are
situated on the vertices of a 2x2 rectangle of equal size squares. The sides of the rectangle
must be parallel to the coordinate axes.
The orange points form a subgrid among all the points on the picture.
You are given ints x and y, where (x[i], y[i]) are the coordinates of the i-th point on the plane. The points are distinct. Return the number of distinct subgrids you can create with these points. Two subgrids are distinct if one contains a point that is not contained in the other.
|Method signature:||int howMany(int x, int y)|
|(be sure your method is public)|
|-||x will contain between 1 and 50 elements, inclusive.|
|-||x and y will contain the same number of elements.|
|-||Each element of x will be between -1000 and 1000, inclusive.|
|-||Each element of y will be between -1000 and 1000, inclusive.|
|-||All points represented by (x[i], y[i]) will be distinct.|
|This is a 4x4 regular grid.|
|This is a 3x3 grid. It forms the only subgrid by itself.|