Given a rectangle R of area 100000, Pancho must completely cover the rectangle R with a finite number of rectangles with sides parallel to the sides of R . Next, Martín colors some rectangles of Pancho's cover red so that no two red rectangles have interior points in common. If the red area is greater than 0.00001, Martin wins. Otherwise, Pancho wins. Prove that Pancho can cover to ensure victory, geometryrectanglecombinatoricscombinatorial geometry