Please help me to do Question 2.

This is a complete Question. All information is provided. And it is based on Branch and bound (B&B), Dijkstra's algorithm..

Question 2: Table 1 shows the transition time of 13 flight legs. The airline now has to determine how to make a route that can minimize the transition time from Sto S'. (a) Please explain whether you would suggest the airline to use B&B or Dijkstra Algorithm. (b) Please also explain by wording how to solve it. [50% marks] Table 1. Transition time of 13 flight legs. 2 3 4 5 6 Direction Transition time (Hours) S to A 5 S to B 7 S to C 5 A to B 3 A to D 1 A to E 7 B to C 1 B to S' 5 C to F 2 D to S' 18 E to S' 13 F to E 3 7 8 9 10 11 12 13 F to S' 19