Consider the following undirected, weighted graph (presented inedge list format).
Node 1
Node 2
Weight
A
B
3
A
F
5
B
C
5
B
G
9
C
D
4
C
H
2
D
E
7
D
I
11
E
J
8
F
G
10
F
K
4
G
H
4
G
L
2
H
I
8
H
M
6
I
J
6
I
N
3
J
O
9
K
L
8
K
P
7
L
M
3
L
Q
10
M
N
5
M
R
5
N
O
4
N
S
8
O
T
4
P
Q
5
P
U
6
Q
R
4
Q
V
8
R
S
7
R
W
2
S
T
9
S
X
3
T
Y
7
U
V
1
V
W
7
W
X
6
X
Y
2
a) Draw the weighted graph.
(Hint: arrange the nodes in a 5 by 5 square in alphabeticalorder).
Use Prim’s Algorithm (vertex at a time), starting at node A, tofind the minimum spanning tree.
b) Draw the minimal spanning tree on the 5 by 5 square ofnodes.
Expert Answer
An answer will be send to you shortly. . . . .