Write the implementation for the DFS pseudocode shown in the picture in Java (First implement the DFS method in the first picture then DFS-VISIT in the second picture)

DFS-VISIT(U) no Source DFS(V, E) 1. for each u eV 2. do color[u] WHITE 3. p[u] - NIL 14. timeo 5. for each u EVE to make sure we 6. do if color[u] = WHITE 7. then DFS-VISIT(u) :00. O 5. visit all nodes 1. color[u] - GRAY 2. timer time+1 + 3. d[u] time >8. color[u] BLACK 9. time time + 1 + 10. f[u]- time 6. Every time DFS-VISIT(U) is called, u becomes the root of a new tree in the depth-first forest Activate Wind Go to Settings to Activate Windows