Insrtuctions for problems 2-5: For each of the following pro…
Insrtuctions for problems 2-5: For each of the following problems, you do not have to prove the correctness of your design or report its runtime. You can use the algorithms from class, such as DFS, Explore, BFS, Dijkstra’s (using min-heaps), SCC, Kruskal’s, Prim’s etc., as a blackbox subroutine for your algorithm. Make sure to explain your algorithm in words (no pseudocode!). Faster – and correct – designs worth more credit.