Suppose a map is made by drawing n intersecting circles. Show that the regions in this map can be properly 2-colored. (a) Solve by an inductive argument. (b) Solve by assigning colors based on the number of circles that contain a region.