For the two complete graphs shown, find the costs of the nearest‑neighbor tour starting at B and of the tour generated by the sorted‑edges algorithm. Give your answers as whole numbers.

graph (a): nearest‑neighbor:

graph (a): sorted‑edges:

graph (b): nearest‑neighbor:

graph (b): sorted‑edges: