Suppose you need to make a trip to 5 different cities in USA over a seven day period (including Seattle), starting and ending in Seattle. What will be optimum route? The optimal Cost?
We make certain assumptions:

1. You can travel the cities in any order. You need to start and end in Seattle.
2. Assume you are travelling during the same time of the day.
3. No fare changes over the days. So, you just pick one day of the week mentioned above to collect your data. Assume to and fro fares are same.
   To do:
4. Go to any airline of your choice and collect the fare data for the cities from Seattle and from each other. Post a screen shot of each. You will have a total of 10 screenshots.
   (10 points)
5. Put the data in a table form, just the way we have in any networking problem. It will result in a 5×5 table (5 points)
6. Draw a di- graph. This should result in a di graph. Graph should be neat and tidy. The networking graphs are called di graphs (for any one who needs explanation) (5 points)
7. Use the method of Sorted edge algorithm (also known as cheapest link algorithm) to find the optimum cost.
   (5 points)
8. Use the repeated nearest neighbor algorithm to find the optimum cost too. (This is going to be a tedious long process) (10 points)
9. Give an explanation of the results obtained by the two methods, comparing them.
   (5 points)
10. Upload everything in a Doc, PDF, jpg or Power Point format. No other formats will be entertained.