50. For each of the accompanying graphs with weights, apply the nearest-neighbor method (starting at vertex A) and the sorted-edges method to find (it is hoped) a cheap tour.

74