I- Given the following graph G1 in Figure 1: See image.
a)Give the adjacency matrix representation of the graph.
b)Give the adjacency list representation of the graph.
c)Give the depth-first traversal of the graph, starting from vertex A. ( in case you have the choice between multiple vertices to visit, always select the vertex that has smaller lexicographic order first, i.e. alphabetical order)
d)Give the breadth-first traversal of the graph, starting from vertex A. ( in case you have the choice between multiple vertices to visit, always select the vertex that has smaller lexicographic order first, i.e. alphabetical order)
e)Draw two spanning trees that can be found in the graph.
f)Find the shortest path between node A and all other nodes in the graph, using Dijkstra's algorithm.