chap graphs initial step process edge (cdd step process edge (efd step process edge (cfd figure illustration of the first three steps of kruskal' mst algorithm as applied to the graph of figure (bif an undirected graph has | edges and no cyclesthen the graph is connected (adraw the adjacency matrix representation for the graph of figure (bdraw the adjacency list representation for the same graph (cif pointer requires four bytesa vertex label requires two bytesand an edge weight requires two byteswhich representation requires more space for this graph(dif pointer requires four bytesa vertex label requires one byteand an edge weight requires two byteswhich representation requires more space for this graph show the dfs tree for the graph of figure starting at vertex