In the GraphImplementations project, consider all of thefollowing directed graph implementations: AdjListIntVertices AdjMatrixIntVertices For each of these classes, add the following methods. Youimplementation must use the existing graph representations and mustuse the algorithms described in class.   public void breadthFirstTraversal(intstart);     public void depthFirstTraversal(int start); public class AdjListIntVertices {    private int N;    private HashSet[] adjList;    @SuppressWarnings(“unchecked”)    public AdjListIntVertices(String fname) {        try {            Scanner input= new Scanner(new File(fname));            N =input.nextInt();            adjList =(HashSet[]) Array                   .newInstance(newHashSet().getClass(), N);            for (int r =0; r ();               for (int c = 0; c canReach(int startVertex){        HashSet reachable= new HashSet<>();        HashSetrecentAdditions = new HashSet<>();        reachable.add(startVertex);       recentAdditions.add(startVertex);        do {           HashSet copyRecentAdditions = newHashSet(                   recentAdditions);           recentAdditions.clear();            for (int v :copyRecentAdditions) {               for (int i = 0; i canReach(int startVertex){        HashSet reachable= new HashSet<>();        HashSetrecentAdditions = new HashSet<>();        reachable.add(startVertex);       recentAdditions.add(startVertex);        do {           HashSet copyRecentAdditions = newHashSet(                   recentAdditions);           recentAdditions.clear();            for (int v :copyRecentAdditions) {               for (int i = 0; i . . .