Q4.1 Total Weight:

What is the total weight of your spanning tree?

Q4.2 Neighbours of a:

What are the neighbours of vertex a in the minimum spanning tree? Give them in alphabetic order without any separators. For instance, if you think that the neighbors of a in the minimum spanning tree are b and e, then write be.

Q4.3 Neighbours of b:

What are the neighbours of vertex b in the minimum spanning tree?

Q4.4 Neighbours of c:

What are the neighbours of vertex c in the minimum spanning tree?

Q4.5 Neighbours of d:

What are the neighbours of vertex d in the minimum spanning tree?

Q4.6 Neighbours of e:

What are the neighbours of vertex e in the minimum spanning tree?

Q4.7 Neighbours of f:

What are the neighbours of vertex f in the minimum spanning tree?

Q4.8 Neighbours of g:

What are the neighbours of vertex g in the minimum spanning tree?

Q4.9 Neighbours of h:

What are the neighbours of vertex h in the minimum spanning tree?

Q4.10 Neighbours of i:

What are the neighbours of vertex i in the minimum spanning tree?

Q4.11 Neighbours of j:

What are the neighbours of vertex j in the minimum spanning tree?

Q4.12 Neighbours of k:

What are the neighbours of vertex k in the minimum spanning tree?

Q4.13 Neighbours of l:

What are the neighbours of vertex l in the minimum spanning tree?

Q4.14 Neighbours of p:

What are the neighbours of vertex p in the minimum spanning tree?

Q4.15 Number of Minimum Spanning Trees:

How many distinct minimum spanning trees does the given graph have?

Q4 Minimum Spanning Tree 19 Points Find a minimum spanning tree in the (edge-weighted) graph below. The weights of the edges of the graph are indicated by the numbers on the edges