Question 20
For each of the two maps shown, what is the fewest different colors needed so that no two neighboring regions have the same color? Give left map; right map.

Two regions are neighbors when they share a boundary segment; touching at one point alone does not count.

Two regions are neighbors when they share a boundary segment; touching at one point alone does not count.