Use the greedy algorithm and the weighted graph below to generate a Hamiltonian circuit starting from each vertex. B 24 5 17. C 15 25 12- D 16 E - total weight total weight - total weight D - total weight m : - total weight F total weight Compare the different circuits to find the one of smallest total weight. O The circuit that begins at vertex A has the smallest weight. O The circuit that begins at vertex B has the smallest weight. The circuit that begins at vertex C has the smallest weight. O The circuit that begins at vertex D has the smallest weight. O The circuit that begins at vertex E has the smallest weight. O The circuit that begins at vertex F has the smallest weight