Consider the following map: O b f d a) Explain how we can use the graph-coloring problem to color the map so that no two neighboring regions are colored the same. b) Use your answer to part (a) to color the map with the smallest number of colors.