Problem 4: Formulate the problem of finding the shortest path between s and t in the graph using linear programming. Solve it using your favorite software. 2 V2 V3 2 1 3 4 4 V1 t 2

3. Use the graph to answer the following questions: a. Can there be a path of length bigger than 2 in the graph? Explain. b. Are there any non-trivial cycles in the graph? Explain. c. Give a trail of length 4. d. Give all self-loops in the graph.

1. Use Dijkstr a's algorithm to find a shortest path from a to z in the following weighted graph. Please show your steps to receive any credit. 04 00 2 5 4 10 3 2 (i 8

Problem 2. The two problems below can be solved using graph coloring. For each problem, represent the situation with a graph, say whether you should be coloring vertices or edges and why, and use the coloring to solve the problem. a. Your Quidditch league has 5 teams. You will play a tournament next week in which every team will play every other team once. Each team can play at most one match each day, but there is plenty of time in the day for multiple matches. What is the fewest number of days over which the tournament can take place? b. Ten members of Math Club are driving to a math conference in a neighboring state. However, some of these students have dated in the past, and things are still a little awkward. Each student lists which other students they refuse to share a car with; these conflicts are recorded in the table below. What is the fewest number of cars the club needs to make the trip? Do not worry about running out of seats, just avoid the conflicts. Student: A B C D E F…