Using java, implement the following algorithm for DFS(Depth- First Search):

1. for each uV 2. do color[u] = WHITE 3. [u] = NIL 4. time = 0 5. for each u V 6. do if color[u] = WHITE 7. then DFS-VISIT(u)

DFS-VISIT(u) is: 1. color[u] =GRAY 2. time = time+1 3. d[u] = time 4. for each v Adj[u] 5. do if color[v] = WHITE 6. then p[v] =u 7. DFS-VISIT(v) 8. color[u] = BLACK 9. time = time + 1 10. f[u] = time