Let’s say that you are trying to solve the traveling salesman problem. Let us compare two particular approaches: Random and Greedy. We will use a small subset of New York cities (NYC, Rochester, Albany, Syracuse). Random Algorithm: 1. Pick a random starting city from (NYC, Rochester, Albany, Syracuse). Let us start with Rochester. Chosen Cities …