Question: We talked about the 'Nearest Neighbor1 algorithm as a way to find an approximation to the optimal Traveling Salesman route. However, while it usually gives a 'reasonably' good solution, there are cases where it does not. Give edge weights to the edges among four vertices so that the Nearest Neighbor algorithm (starting with vertex A) gives the worst possible route. Check all other possible cycles to verily this.