test the program for obtaining the depth first spanning tree for the following graph " graph may have many spanning treesfor instance the complete graph on four vertices has sixteen spanning treesexplain define vertices of graph graph is regular if every vertex has the same valence (that isif it is adjacent to the same number of other verticesfor regular grapha good implementation is to keep the vertices in linked list and the adjacency lists contiguous the length of all the adjacency lists is called the degree of the graph the topological sorting functions as presented in the text are deficient in error checking modify the (adepth-first and (bbreadth-first functions so that they will detect any (directedcycles in the graph and indicate what vertices cannot be placed in any topological order because they lie on cycle how can we determine maximal spanning tree in network write digraph methods called write that will write pertinent information specifying graph to the terminal the graph is to be implemented with an adjacency tableb linked vertex list with linked adjacency listsc contiguous vertex list of linked adjacency lists notes implement and test the method for determining shortest distances in directed graphs with weights answersself assessment spanning trees edges algorithm unordered directed cycle true false false true true lovely professional university