Project Two
Traveling-Salesman Problem
Decoding deadline 2/25/03
Due date 3/11/03
Written Report
Encrypted:
Dbkfovsxq-Ckvocwkx Zbylvow

Gbsdo k zcoeny myno dy psxn dro wycd yzdswkv cyvedsyx dy dro
"Dbkfovsxq-Ckvocwkx" Zbylvow gsdr 3, 4 kxn 5 msdsoc. Iyeb psxkv bozybd cryevn
sxmveno dro pyvvygsxq.

1) Dro zcoeny myno pyb okmr yp dro zbylvowc klyfo.
2) Dswo mywzvohsdi kxkvicsc pyb okmr yp dro klyfo zbylvowc.
3) Zvyd dro dswo mywzvohsdi pyb okmr yp dro klyfo zbylvowc.
4) Kccewsxq drkd cyvedsyx mkx lo pyexn pyb 3 msdsoc sx 1 comyxn grkd sc dro
   ocdswkdon dswo pyb 20, 50 kxn 100 msdsoc.

Decrypted:
Traveling-Salesman Problem

Write a pseudo code to find the most optimal solution to the
"Traveling-Salesman" Problem with 3, 4 and 5 cities. Your final report should
include the following.

1) The pseudo code for each of the problems above.
2) Time complexity analysis for each of the above problems.
3) Plot the time complexity for each of the above problems.
4) Assuming that solution can be found for 3 cities in 1 second what is the
   estimated time for 20, 50 and 100 cities.