Suppose a graph is created in the following code. Using the DFS algorithm in the text, what is the output for the path from $4$ to $0?$

Integer$[]$ vertices $=(0,1,2,3,4)$;Graph graph$1=$ new UnweightedGraph vertices$,$ edges$)$;UnweightedGraph.Tree dfs $=$ graph$1.$dfs$(0)$;System.out.println$($dfs$.$getPath$(4))$;$[4,3,2,1,0][4,3,2,0][4,1,0][4,1,2,0][4,3,1,0]$