Adjacency List and Graph Traversal using DFS and BFS

Representing the Graph as an Adjacency List

Represent the given graph as an adjacency list with neighbors listed in lexicographicallysorted order.(b)(4 points)Provide the order of visited vertices after running DFS starting from vertexA. Assume thatneighbors are visited in the same order as they appear in your adjacency list.(c)(4 points)Do the same as in (b) except using BFS starting from vertexA.