2. Represent the given map as a graph and answer the following questions. a. Represent the given map as a graph. b. Explain how we can use the graph-coloring problem to color the map so that no two neighboring regions are colored the same. In the graph coloring problem two adjacent vertices will colored differently. For example if vertices A and B are adjacent vertex A can be colored blue' and B can be colored anything but 'blue. c. Use your answer to part (a) to color the map with the smallest number of colors. 2. Represent the given map as a graph and answer the following questions. a. Represent the given map as a graph. b. Explain how we can use the graph-coloring problem to color the map so that no two neighboring regions are colored the same. In the graph coloring problem two adjacent vertices will colored differently. For example if vertices A and B are adjacent vertex A can be colored blue' and B can be colored anything but 'blue. c. Use your answer to part (a) to color the map with the smallest number of colors