The next four questions refer to the following directed graph: V = {V0; V1; V2; V3; V4; V5; V6}. There are the following twelve edges, with edge costs listed as the third item in the triplet: E = {(V0; V2; 4); (V1; V0; 2); (V1; V3; 3); (V3; V0; 1); (V3; V2; 2); (V3; V5; 8); (V3; V6; 4); (V4; V1; 10); (V4; V3; 2); (V4; V6; 7); (V5; V2; 2); (V6; V5; 1)}
Which of the following graph traversals yields V4V6V5V2V3V0V1?