10 20 60 32 Provide the Adjacency Matrix and Adjacency Table representations of the graph G. Perform a BFS for the graph G starting with vertex A, with any additional "starts" of BFS (in the main loop) proceeding in alphabetical order. Perform a DFS for the graph G starting with vertex A, with any additional "starts of DFS (in the main loop) proceeding in alphabetical order