14. The longest-circuit tour of vertices that arises by applying the nearest-neighbor algorithm starting at any of the sites 0, 1, 2, 3 in the graph below has a cost of __________.