AT3. Answer the following.

1. Travel Nicole wants to tour Asia. She will start and end her journey in Tokyo and
visit Hong Kong, Bangkok, Seoul, and Beijing. The airfares available to her
between cities are given in the table. Draw a weighted graph that represents the
travel costs between cities and use the greedy algorithm to find a low-cost route.

For #s 2 and 3 Fictional maps of countries of a continent are given. Represent each
map by a graph and find a coloring of the graph that uses the fewest possible number
of colors. Then color the map according to the graph coloring you found. Present your
answers in manual art or digital forms.

2. 3.