Consider the Traveling Salesperson problem.
a) Write the brute-force algorithm for this problem that consider all possible tours.
b) Implement the algorithm and use it to solve instance of size 6,7,8,9,10,15 and 20.
c) Compare the performance of this algorithm to that of Algorithm using the instance developed in (b) above.