Question 2 (40 POINTS): A Minimum Spanning Tree (MST) is defined for a connected, undirected and weighted graph. Suppose we have a connected undirected graph whose weights are positive for some edges, and negative for some others. 2.A.) (20 POINTS) Does Kruskals Algorithm run correctly on such a graph? Please work on an example graph and justify your answer. 2.B.) (20 POINTS) Does Prims Algorithm run correctly on such a graph? Please work on an example graph and justify your answer.