1. Week 9 problem builddeps on Kattis.

(a) Explain how DFS can be used to solve this problem. Make sure you describe what needs to be done to print the files in the right order.

(b) Use your insight from (a) to implement a solution using your preferred language and submit your implementation via Kattis.

2. Week 9 problem reversingroads on Kattis. (a) Explain how Kosaraju-Shamir's strongly connected components algorithm can be used to solve this problem. Make sure you also describe how to find the edge to reverse, if it is necessary and if it exists, that makes the case valid.

(b) [One of 2(b) and 3(b) is optional] Use your insights from (a) to implement a solution using your preferred language and submit your implementation via Kattis.

3. Week 9 problem kitchen on Kattis.

(a) Explain how Dijkstra's algorithm can be used to solve this problem. Since no graph is described explicitly in the problem, describe the graph that Dijkstra's algorithm is applied to and how its nodes and edges are generated.

(b) [One of 2(b) and 3(b) is optional] Use your insights from (a) to implement a solution using your preferred language and submit your implementation via Kattis.