1. For the graph shown, find the adjacency matrix of the graph. 8. 2. For the graph shown above, use Kruskaľ's algorithm to find a minimum spanning tree. 3. For the graph shown above, use Prim's...

Please help me with number 2 on this Discrete II Problem. Thank you.


Extracted text: 1. For the graph shown, find the adjacency matrix of the graph. 8. 2. For the graph shown above, use Kruskaľ's algorithm to find a minimum spanning tree. 3. For the graph shown above, use Prim's algorithm using vertex B as a starting point. 4. Use Dijkstra's algorithm to find a shortest path from vertex B to vertex E.