Hi, I'd like help reviewing these questions. First of all, the instructions for number one should read "for visiting all the cities once and then returning to the original destination."

Question 1:

a) I believe the answer should be O(n). The for loop will bring in the first n and the if statement and all other orders of operation are negligible constants. Let me know if I'm misguided please.

b) I'm more unsure of this.. would we fill in values for the algorithm and then proceed to set that function f(n)

Question 2: I'm not sure how to calculate the asymptotic time complexity. For c and n_0 we can just plug in our own values to make the function work, correct?

a) T(n) = O(1)

b) T(n) = O(n)

c) T(n) = O(n^3)

d) T(n) = ?

Thank you for any and all help!

1. The Traveling Salesman problem (TSP) is a famous problem for which there is no known, tractable solution (though efficient, approximate solutions exist). Given a list of cities and the distances in between, the task is to find the shortest possible tour (a closed walk in which all edges are distinct) that visits each city exactly once Consider the following algorithm for solving the TSP: n = number of cities m nxn matrix of distances between cities min = (infinity) for all possible tours, do find the length of the tour iflength