Problem 1040

Draw a rectangle. Connect the midpoints of the opposite sides to get 4 congruent rectangles. Connect the midpoints of the lower right rectangle for a total of 7 rectangles. Repeat this process infinitely. Let $n$ be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing an edge have the same color and $m$ be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing a corner have the same color. Find the ordered pair $(n, m)$.