there is a graph first step to but I cannot draw it on here but you already have your answer without Step 2
Step-by-step explanation:
a simple path in a graph G that passes through every vertex exactly once is called a path . the graph G has no past because any past containing all vertices must contain one of the edges (e, c) (d, f ) and (B, G) move than once .
