You live in Phoenix, and you need to visit Portland, San Francisco, and Washington, D.C. a. How many different circuits does your graph have? b. Approximate the cheapest route, using the nearest...

You live in Phoenix, and you need to visit Portland, San Francisco, and Washington, D.C.

a. How many different circuits does your graph have?

b. Approximate the cheapest route, using the nearest neighbor algorithm. Draw this route’s graph.

c. Approximate the cheapest route, using the repetitive nearest neighbor algorithm. Draw this route’s graph.

d. Approximate the cheapest route, using the cheapest edge algorithm. Draw this route’s graph.

e. Find the cheapest route, using the brute force method. Draw this route’s graph.