$\backslash$table$[[,$A$,$B$,$C$,$D$,$E$],[$A$,0,1,0,0,0],[$B$,0,0,1,1,0],[$C$,0,0,0,0,1],[$D$,1,0,0,0,0],[$E$,0,0,0,1,0]]$

a$)$ Draw the graph represented by the above matrix.

b$)$ Represent the graph using a linked list.

c$)$ Show the steps to find the minimum spanning tree for this graph.

d$)$ Show the steps$\_$to find the shortest path starting from $A.$

e$)$ Show the steps to find the shortest path between $B$ and $E.$

$2.$ What will be the adjacency matrix and minimum spanning tree for the below undirected weighted graph?

$3.$ Find the following for the below graph:

a$.$ Adjacency matrix.

b$.$ Linked list.

c$.$ Shortest path using Dijkstra's algorithm.

d$.$ MST using Kruskal's algorithm.

e$.$ MST using Prim's algorithm.

Weighted Directed Graph