(Solved): Apply the repeated nearest neighbor algorithm to the graph above. Starting at which vertex or vert ...

Apply the repeated nearest neighbor algorithm to the graph above. Starting at which vertex or vertices produces the circuit of lowest cost? A. B \( \mathrm{C} \) D \( \mathrm{E} \) \( \mathrm{F} \) What is the lowest cost circuit produced by the repeated nearest neighbor algorithm? Give your answer as a list of vertices, starting and ending at vertex A. Example: ABCDEFA Question Help: \( \square \) Video