Problem 8 (25%) Apply the Depth-First Search algorithm to find out the traversal order, where the vertex "a" is the start, and the vertices with lower adjacent weights should be visited first. Please justify your answer. Otherwise, you get 0 points. Hint: Use a stack.