Given the following adjacency matrix representing a directed graph, run depth-first search (DFS) starting from vertex A and stopping at vertex F. Suppose that at each step of the DFS, adjacent vertices are explored alphabetical order. For example, if node B has neighbors A and E, neighbor A will be evaluated before E. What order does the DFS explore the nodes in this graph starting from vertex A? Enter the letters without any spaces, e.g. ABC... What is the shortest path from vertex A to vertex F ? Enter only the letters without any spaces, e.g. ABC... (enter the vertices in the path including the start and end vertices