Problem #1 Consider the following adjacency matrix: A B B C D E F G A 0 0 0 1 1 0 0 B 0 0 0 0 0 1 1 с 0 0 0 1 0 1 0 Ꭰ 1 0 1 0 0 1 0 E 1 0 0 0 0 1 0 F 0 1 1 1 1 0 1 G 0 1 0 0 0 1 0 Could this matrix represent an undirected graph, or must it represent a directed graph? Explain your reasoning. Give the adjacency list representation of the same graph./nс Draw the graph. D List the order in which vertices would be visited in the Depth-First Search algorithm, starting at vertex A. Assume that DFS processes vertices alphabetically, when there are multiple to explore. E List the order in which vertices would be visited in the Breadth-First Search algorithm, starting at vertex A. Assume that BFS processes vertices alphabetically, when there are multiple to explore.

Fig: 1

Fig: 2