Please provide examples.

1. Write a class DepthFirstPaths.java to implement a Depth First Search algorithm ively you can download the file using the pseudocode given below. Alternat DepthFirstPaths.java and implement al the unimplemented methods of the class so that it perfoms Depth First Search on graph G. See the pseudocode given below DFS(G) l for each vertex u E G.V .color-WHITE .TNIL time-0 5 for each vertex uEG.V if u.color WHITE DFS-VisIT(G, u) DFS-VISIT(G,u) time- time +1 2 u.d time 3 u.colorGRAY 4 for each v e G.Adiu) I/ white vertex u has just been discovered II explore edge (u, v) if v.color WHITE DFS-VISIT(G, v // blacken u; it is finished 8 M.colorBLACK timetime +1 10 .f time 2. Write a driver program, which reads input file mediumG.txt as an undirected graph and runs the Depth First Search algorithm to find paths to all the other vertices considering 0 as the source. This driver program should display the paths in the following manner: 0 to v: "list of all the vertices traversed to go to v from 0, separated by