Consider an undirected graph that may have negative edge weights. (a) Will Kruskal's algorithm still generate the minimum spanning tree? If so, explain why. If not, give an example on which Kruskal's algorithm will fail. (b) Will Prim's algorithm still generate the minimum spanning tree? If so, explain why. If not, give an example on which Prim's algorithm will fail.