5.
Given the following weighted graph $G_2 = (V_2, E_2)$, $V_2 = \{1, 2, ..., 8\}$.
1
13
4
2
8
3
14
10
12
6
9
5
3
11
5
6
1
7
4
15
2
8
Starting at vertex 1, compute a minimum spanning tree for $G_2$ using Prim's labeling
algorithm
Remark: You must construct/illustrate a table to illustrate clearly how the labels of the
vertices in $V$ are updated