This program must be written in Java. It should be as efficient as possible and be as little lines as possible.

Given an array of windows in the plane, we want to count how many overlapping and how many enclosing pairs of windows there are (without double counting). A window is the region of the plane enclosed by a rectangle with sides parallel to the x and y axes. A window can be abstracted as an object with the 4 fields of doubles: (left, right, bottom, top). These fields should satisfy the invariant: left