Minimum Spanning Tree Problem. Construct Minimum Spanning Tree

for the following weighted undirected graph using the Kruskal's

Algorithm. List the order of the edges, in which they are added to

the Minimum Spanning Tree.

Minimum Spanning Tree Problem. Starting with vertex D$,$ construct

Minimum Spanning Tree for the following weighted undirected graph

using the Prim's Algorithm. List the order of vertices, they are

added to the Minimum Spanning Tree.