Python:

1.How many spanning trees are there for the graph? List all spanning trees and explain how to find it.

2.Use Prims algorithm to find a minimum spanning tree for the graph. List the edges added to the tree after each iteration of the algorithm, and state the weight of the final spanning tree. And explain how to find it.

2 6 3 5 4 1 1 3 3 3 5 2 4 2 6 8 3 3