Using Prim$$s Algorithm, starting at vertex A$,$ find the

Minimal Spanning Tree $($MST$)$ for the weighted graph

G in figure $4\mathrm{.}2$ below.