1. How many possible tours would a brute force approach to solve the Traveling Salesperson Problem (TSP) consider?

2. What (optimality statement) is true about part of an optimal tour?

3. List all the sets containing 2 elements.

4. Complete the D[ ] elements listed below:

5. To implement this TSP procedure, how many loops would be needed (Briefly discribe what each would do and the nesting of these loops)?

6. For algorithm 3.11 what is the execution time formula?

T(n) =