f). True or False. Prim's algorithm will work with negative edge weights. True False g). True or False. It's impossible for the MST of a graph to contain the largest weighted edge. True False h). True or False. The Shortest Paths Tree returned by Dijkstra's will never be a correct MST. True False i). True or False. A graph with unique edge weights will have exactly one MST. You might find it useful to know that Kruskal's algorithm can generate any MST depending on its tie-breaking scheme. True False j). True or False. A graph with non unique edge weights will always have a non unique MST True False k). True or False. If you take any graph G with positive edge weights and square all the edge weights and turn it into the graph G', G and G' have all the same MST's True False I). True or False. The minimum weight edge of any cycle in a graph G will be part of any MST of G True False

f). True or False. Prim's algorithm will work with negative edge weights. True False g). True or False. It's impossible for the MST of a graph to contain the largest weighted edge. True False h). True or False. The Shortest Paths Tree returned by Dijkstra's will never be a correct MST. True False i). True or False. A graph with unique edge weights will have exactly one MST. You might find it useful to know that Kruskal's algorithm can generate any MST depending on its tie-breaking scheme. True False j). True or False. A graph with non unique edge weights will always have a non unique MST True False k). True or False. If you take any graph G with positive edge weights and square all the edge weights and turn it into the graph G', G and G' have all the same MST's True False I). True or False. The minimum weight edge of any cycle in a graph G will be part of any MST of G True False