Indicate a minimum spanning tree of the below graph.

Suppose we were to execute Prim's algorithm beginning at the center bottom vertex. In what order would edges be added to the minimum spanning tree?

Suppose we were to execute Kruskal's algorithm beginning at the center bottom vertex. In what order would edges be added to the minimum spanning tree?

Give an example of an undirected, weighted graph for which there is a pair of vertices s and t where the shortest path from s to t does not lie within the graph's minimum spanning tree. Justify your answer.