Execute a depth-first search traversal of the graph below, starting at F and stopping the traversal once E is reached. At a given vertex, when there are multiple edges to the next level, explore edges in reverse alphabetical order of the adjacent vertices. For example, the first edge to explore will be the edge that connects F to H, since H comes after C in the alphabet.

List all of the vertices visited, in order of when they were first visited. If the traversal requires back-tracking, do not include a vertex visited for the second or subsequent time.

Your response will look like FH...E with zero, one or more letters between H and E.