5. (15 pts) Let G b e a fully-connected graph with a source node s for which Kruskal's and Prim's artial MSTs on each iteration. That is, after running either algorithms produce the same p algorithm for i iterations, their partial results (with i edges) are identical. Draw a graph with at least six vertices and ten edges that satisfies this condition Hint: Remember that you must assign specific weights to the edges of your graph