Finding a minimum spanning tree using Primm algorithm and graph question

1. Find using Prim algorithm a minimum spanning tree of a graph with at lease 7 vertices. (you pick which one) 2. How many times would you change div] in a graph with m, n vertices/edges