Determine the output of depth-first search given the graph G shown in figure below as input? Indicate your answer as a matrix whose rows are the paths describing the output. Start at vertex a and follow alphabetical order. The number of columns in the matrix so obtained should be l1 where l is the length of the longest path. For paths shorter than l, fill up the remaining slots with zero (0)