[Graphs generated by this script: setBorder(60,30,60,30);initPicture(-10,10,2.5,7.5); fontsize=14;fontstyle='none';marker=null;line([-10,2.5],[10,2.5]);line([-10,2.5],[10,5]);line([-10,2.5],[10,7.5]);line([-10,5],[10,2.5]);line([-10,5],[10,5]);line([-10,5],[10,7.5]);line([-10,7.5],[10,2.5]);line([-10,7.5],[10,5]);line([-10,7.5],[10,7.5]);fontbackground='white';fontfill='blue';text([-10,2.5],'A','belowleft');dot([-10,2.5]);fontfill='red';text([-6,2.5],'8');fontfill='red';text([6,4.5],'12');fontfill='red';text([-6,3.5],'14');fontfill='blue';text([-10,5],'B','belowleft');dot([-10,5]);fontfill='red';text([6,3],'6');fontfill='red';text([-6,5],'9');fontfill='red';text([6,7],'13');fontfill='blue';text([-10,7.5],'C','aboveleft');dot([-10,7.5]);fontfill='red';text([-6,6.5],'4');fontfill='red';text([6,5.5],'11');fontfill='red';text([-6,7.5],'1');fontfill='blue';text([10,2.5],'D','belowright');dot([10,2.5]);fontfill='blue';text([10,5],'E','belowright');dot([10,5]);fontfill='blue';text([10,7.5],'F','aboveright');dot([10,7.5]);]

Apply the repeated nearest neighbor algorithm to the graph above. Starting at which vertex or vertices produces the circuit of lowest cost?

What is the circuit produced by the nearest neighbor algorithm? Give your answer as a list of vertices, starting and ending at vertex A. Example: ABCDEFA