Part A $[2$ pts$]$:$$ List the four edges in the minimum spanning tree for this graph using Kruskal$$s algorithm, in the order in which you add them.$$

$1$st edge:$1($A $,$ B$)$

$2$nd edge:$$

$3$rd edge:$$

$4$th edge:

$$

Part B $[2$ pts$]$: List the four edges in the minimum spanning tree for this graph using Prim$$s algorithm, starting with node E$,$ in the order in which you add them.$$

$1$st edge:$$

$2$nd edge:$$

$3$rd edge:$$

$4$th edge: