Discrete Computational Structures - Project 2 (Final Project) December 11, 2022 1. Prove Hall's Marriage Theorem and provide an original example and an original counterexample where Hall's condition holds and does not hold, respectively. 2. For the following graph find all shortest paths from Node 1 to Node 5 using labelling method with depth-first, breadth-first and Dijkstra schemes. Explain how dynamic programming can be used for this task. Explain in general the advantages and this advantages of these four methods