Please complete the findPathBFS() method.

here's part 1 of the question: https://www.chegg.com/homework-help/questions-and-answers/please-complete-completegraph-method-q20794417

here's part 2 of the question: https://www.chegg.com/homework-help/questions-and-answers/please-complete-valence-method-s-part-1-question-https-wwwcheggcom-homework-help-questions-q20794561

here's part 3 of the question: https://www.chegg.com/homework-help/questions-and-answers/please-complete-dfs-method-s-part-1-question-https-wwwcheggcom-homework-help-questions-ans-q20794695

1 import java .ut ArrayList 6 Generic vertex class 7 class Vertex public T data public boolean visited 10e public Vertex data null visited false 130 public Vertex(T data data -data; visited false 16e public string tostring t return data. tos tring 19 Declare any additional vertex attribute you may need 20 22 public class Graph T 23 array of vertices 24 protected ArrayList> verts 25 26 20 array representing adjacency matrix of an unweighted graph If adj Mat is true, there is an edge from verte i to j 27 otherwise the element adj Mat l is false. 28 29 protected boolean adj Mat 30 32 public Graph ArrayList tex> verts boolean -mat) check the validity of input parameters 33 int nverts J verts 34 adjacency matrix must be square matrix of NxN 35 if Jmat. ength nverts return 36 for (int i30; i nverts i++) 37 if -mat ength nverts return 38