( ( ( ( ( ( , assume thatin traversal of gthe adjacent vertices of given vertex are returned in the same order as they are listed in the table above draw give the sequence of vertices of visited using dfs traversal starting at vertex give the sequence of vertices visited using bfs traversal starting at vertex - would you use the adjacency list structure or the adjacency matrix structure in each of the following casesjustify your choice