Let n be an integer greater than 3. Show that it is possible to divide a square into n2+1 or more disjointed rectangles and with sides parallel to those of the square so that any line parallel to one of the sides intersects at most the interior of n rectangles.Note: We say that two rectangles are disjointed if they do not intersect or only intersect at their perimeters. geometrycombinatoricscombinatorial geometryRectanglestiles