Consider the following undirected graph $G=(V,E).$

$($a$)$ Illustrate a run of Kruskal's algorithm on this graph by filling in the table below. State

at each step which edge is added to the tree. We have filled the first step in for you.

Here, we only want the edge added to the tree and not every edge that is

considered.

$($b$)$ Illustrate a run of Prim's algorithm on this graph starting from vertex $A$ by filling in the

table below. State at each step which edge is added to the tree. We have filled the first

step in for you. Here, we only want the edge added to the tree and not every

edge that is considered.