10 20 Figure A 3. Considering Figure - A above: matrix representation for the graph. b. Draw the adjacency list representation for the graph. c. If a pointer requires four bytes, a vertex label requires two bytes, and an edge weight requires two bytes, which representation requires more space for this graph? d. Show the DFS tree for the graph of Figure- A, starting at Vertex 1. e. Show the BFS tree for the graph of Figure - A, starting at Vertex 1. f. List the shortest paths from vertex 1 to each of the other vertexes. |