Problem 27. The Greedy Algorithms (NN and CL), like Fleury's Algoihm but unlike the Brute Force Algorithm, are very quick and efficient to apply. The problem with them is that, unlike Fleury's Algorithm, they don't always give us the shortest path! Find a (small) example of a weighted graph in which neither of the Greedy Algorithms produce a correct answer to the TSP. (This proves mathematically that greed does not always pay!)