Need to implement a DFS in JAVA. Program should take as input graph adjacency matrix and generate the following.

Order in which vertices are first encountered. Assume that the vertices are visited in numerical order when no other order is specified by the search. . Order in which vertices become dead-ends. . The number of connected components in the graph. Tree edges. . Back edges. 3 4 5 8 Figure 1: Example graph is specified in a text fBle with the In the example graph shown in Figure I, the input graph adjacency following content: 0 1 0 0 11 0 0 10 0 0 01 1 o 0 001 0 01 0 0 01 0 0 001 10 0 01 0 0 1100 1 0 0 0 01100001 0 0 01 0 0 0 Note that the vertex identifiers correspond to the row indices (and column indices) of the adjacency matrix. For First encouatered: 1 267 435 S First dead eads: 8 7541 263 The munber of connected components is I. The tree edgys and back edges are giveu by two adjacency matrices the above example, DFS should generate the following vertex orderings (count value for vertices)