# Question: consider the graph below you will be building a mst...

###### Question details

Consider the graph below. You will be building a MST for this graph in two ways. When there is a tie on the edge weights, consider the edges or nodes in alphabetical order. (For an edge, this means (a,f) before (b,c) and (c,d) before (c,g).)

(a) Use Kruskal’s method.

(b) Use Prim’s method.