DO NOT COPY CODE FROM THE INTERNET! 1. Perform a depth-first search of the Australia digraph given below,starting at Sydney. List the order in which the cities are processed.Do the same for a breadth-first search.PerthCSC 236 Lab 7 (2 programs) graphs15Darwin4BlackStump3Adelaide23CanberraMelbourne2. Consider the graph below. Write a program that outputs the shortestdistance from node 0 to every other node in the graph.8Fly Crocodile AirlinesHobart12BrisbaneSydney

Since you have posted multiple questions, we will provide the solution only to the first question as per our Q&A guidelines. Please repost the remaining questions separatelCode: package dfs_bfs;import java.util.LinkedList;import java.util.Queue;/**** @author BANE*/public class DFS_BFS {String[] place=new String[9];public static void main(String[] args){new DFS_BFS();}int N;boolean[][] G; // G[i][j] is true if there is an edge from i to jDFS_BFS(){setupGraph();System.out.println("------------------------------");System.out.println();// perform a DFS on the graphDFS();System.out.println();System.out.println("------------------------------");System.out.println();// perform a BFS on the graphBFS();System.out.println();System.out.println("------------------------------");System.out.println();}// initial setup of the graphvoid setupGraph(){ //String[] place=new String[9]; place[0]="Darwin"; place[1]="Perth"; place[2]="whick chump"; place[3]="Brisbane"; place[4]="Canbera"; place[5]="Adelaide"; place[6]="Melbourne"; place[7]="Hobert"; place[8]="Sydney";N=9;G=new boolean[N][N]; G[0][4]=G[1][2]=true; // notice that for each edge G[i][j] == G[j][i]G[2][0]=G[3][8]=true; // this means that the graph is undirectedG[4][3]=G[4][5]=true;G[4][8]=G[5][1]=true;G[5][6]=G[6][4]=true;G[6][7]=G[7][6]=true;G[8][4]=true;} // perform a DFS on the graph Gvoid DFS(){boolean[] V=new boolean[N];for (int i=0; i<N; ++i)if (!V[i]){ System.out.println("Starting a DFS starting at "+ place[i]);DFS(i,V);}System.out.println();}// perform a DFS starting at node at (works recursively)void DFS(int at, boolean[] V){System.out.println("At "+ place[at] +" in the DFS.");V[at]=true;for (int i=0; i<N; ++i)if (G[at][i] && !V[i]){DFS(i,V);}} // perform a BFS on the graph Gvoid BFS(){boolean[] V=new boolean[N];for (int i=0; i<N; ++i)if (!V[i]){System.out.println("Starting a BFS starting at "+place[i]);BFS(i,V);} System.out.println(); } // perform a BFS starting at node startvoid BFS(int start, boolean[] V){ Queue Q=new LinkedList(); // A queue to process nodes // start with only the start node in the queue and mark it as visitedQ.offer(start);V[start]=true; // continue searching the graph while still nodes in the queuewhile (!Q.isEmpty()){int at=Q.poll(); // get the head of the queueSystem.out.println("At "+place[at]+ " in the BFS."); // add any unseen nodes to the queue to process, then mark them as visited so they don't get re-addedfor (int i=0; i<N; ++i)if (G[at][i] && !V[i]){Q.offer(i);V[i]=true; }}}}