Given the six$-$vertex graph $($see below$)$ where each of six vertices $($numbered as $1,2,...,$ and $6)$ is connected to all others by an edge with the assigned weights.

$$

$$

$($a$)$ Compute a minimal$-$cost spanning tree using Kruskal$$s Algorithm. Show the tree and cite its total cost.

$$

$($b$)$ Use Primm$$s Algorithm and compute a minimal$-$cost spanning tree starting at vertex numbered as $6$ on the given six$-$vertex graph. Show the spanning tree and cite its cost.

$$

NOTE: DO THIS BY HAND $[$step$-$by$-$step$]($using any simple drawing tool$)!$ No need to write code.