please help me with this questions
Graphs and trees 4. (6 marks] Using the following graph representation (GVE,w)): V-a, b,c, d,e,f E-Ha,b,fa,f a,d,b,e) b,d,c,f, c,d), d,el d. fh W(a, b) 4, W(a,f)-9, W(a, d10 W (b,e) 12, W (b,d) 7, W(c,d) 3 W(c,f)-2, W(d, e) 14, W(d, J)-6 a) [3 marks] Draw the graph including weights b)12+1-3 marks] Given the following algorithm for finding a minimum spanning tree fora graph Given a graph (G(V,E)) create a new graph (F) with nodes
PayPal Gateway not configured
PayPal Gateway not configured