Please solve

This problem is worth 3 points. Please fill in the blank and ensure your answer is a set of numbers without any spaces, arrows, dots, quotes, or any other symbols in between. For example, if the answer is 0>27>2>13, then enter 027213 instead of 027213,0>27>2>13,027213, etc. Consider the following undirected graph. Write down the order in which the vertices (nodes) will be visited by a depth first search (DFS) starting from the node 0 . If there are multiple valid choices, then assume that the numerically smaller vertices will be visited first (i.e., if both 5 and 9 are valid choices in a certain step, then choose 5 since 5