Using the definitions
class Point:
"""attributes: x, y"""
class Rectangle:
"""attributes: width, height, corner"""
and the function @point_in_rectangle@ from problem X53379, write a function
rectangle_in_rectangle(r1, r2)
that returns @True@ if all of the corners of a rectangle @r1@ fall inside a rectangle @r2@, and @False@ otherwise. For example, a rectangle of width , height , and lower-left corner falls inside a rectangle of width , height , and lower-left corner , but a rectangle of width , height , and lower-left corner does not.
The input consists of several pairs of rectangles (four non-negative integer numbers for each: the width, the height, and the coordinates of the lower-left corner).
For each pair of rectangles, print whether or not the first rectangle fall inside the second rectangle.
Input
50 100 25 25 100 200 0 0 50 100 0 0 100 200 0 0
Output
True False