You have some business meetings in a few different cities and you are planning your route so that it is least amount of money. You will start in cu*mming and end back in CU*MING. Use the NEAREST NEIGHBOR ALGORITHM to determine your route.

1. Which city will you visit first (after leaving Cu^ming)? Why?
2. What will be the 2nd city you visit? Why?
3. What will be the 3rd city you visit? Why?
4. What was the total cost of the trip?

1- After leaving C, I would travel to Buford.

2- After leaving Buford you can travel to either Athens or Dacula. Both rides cost the same so it doesn't matter which one you pick. I chose Athens.

3- The third city will be whichever option you didn't choose. For example because I chose Athens, I now have to travel to Dacula.

4- The total cost of the trip is $185

Step-by-step explanation:

I took the CR quiz and got a 100% I hope this helps :)

  q

step-by-step explanation:

each line from a vertex to the midpoint of the opposite side is called a median. the point where the medians intersect, point q, is the centroid.

the centroid of δabc is point q.

congruent segments

step-by-step explanation: