Fill in the blanks based on the graph shown below.

A minimum spanning tree includes all the paths from node A to every other node such that

the cost to reach each node from $A$ is minimized.

What is the minimum cost to reach each of these nodes, starting from node A$?$

$B$

@$C$

$D$

@$E$

Name one edge that is NOT included in the minimum spanning tree of this graph? $($the

name of an edge is the part of nodes that it connects$)$