develop software to perform a dfs starting at dallas (always choose the edge with the smallest mileage). identify the discovery edges and the back edges within your code. when identifying edges output the origin vertex and destination vertex (not the actual distance). there should only be one output per edge with the corresponding type. what is the total distance travelled on the discovery edges? use an adjacency list structure.