1. For the graph shown, find the adjacency matrix of the graph. 303 8. 5. 2. For the graph shown above, use Kruskal's algorithm to find a minimum spanning tree. 10 17 3. For the graph shown above, use...

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


Extracted text: 1. For the graph shown, find the adjacency matrix of the graph. 303 8. 5. 2. For the graph shown above, use Kruskal's algorithm to find a minimum spanning tree. 10 17 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.