please asnwer hand write

Consider the same setting as in Question 1. Now assume that, he uses the elevator every time he moves from one floor to another. The shortest distances between the rooms are given in Table 2.2. Table 2.2 Distances in m) between the entrance and the instructors Instructor 1 Instructor 2 Instructor 3 Instructor 4 Entrance 20 22 26 30 Instructor 1 2 4 10 Instructor 2 5 Instructor 3 9 8 (a) Find a solution for this problem using Christofides heuristic. What is the visiting order to the instructors? (b) Find a lower bound using MSTP setting r to Instructor 2. Repeat this step when r is set to Instructor 4. Which is a better lower bound? Consider the same setting as in Question 1. Now assume that, he uses the elevator every time he moves from one floor to another. The shortest distances between the rooms are given in Table 2.2. Table 2.2 Distances in m) between the entrance and the instructors Instructor 1 Instructor 2 Instructor 3 Instructor 4 Entrance 20 22 26 30 Instructor 1 2 4 10 Instructor 2 5 Instructor 3 9 8 (a) Find a solution for this problem using Christofides heuristic. What is the visiting order to the instructors? (b) Find a lower bound using MSTP setting r to Instructor 2. Repeat this step when r is set to Instructor 4. Which is a better lower bound