EXERCISE BREAK: Which of the following are valid ways to modify an unweighted graph to have Dijkstra's Algorithm be able to accurately produce the shortest paths (in terms of fewest number of edges) from one vertex to all other vertices? (Select all that apply) Multiple Choice Quiz - Select the correct answer(s) from the list No valid modifications can be made; this excersise break is a trick question We can assign a cost of 1 to each edge. We can assign a cost of /to each edge We can assign a cost of-1 to each edge. No modifications need to be made; the algorithm already takes into account unweighted edges. We can assign any cost to any edge and Dijkstra's will inevitably produce the shortest path