PROBLEM SET 10.2A 1. For Problem 1, Set 10.1a, develop the backward recursive equation, and use it to find the optimum solution. 10.3 Selected DP Applications 405 12 14 3 3 FIGURE 10.3 Network for Problem 3, Set 10.2a 2. For Problem 2, Set 10.1a, develop the backward recursive equation, and use it to find the optimum solution. *3. For the network in Figure 10.3, it is desired to determine the shortest route between cities 1 to 7. Define the stages and the states using backward recursion, and then solve the problem. 5 6 12 PROBLEM SET 10.2A 1. For Problem 1, Set 10.1a, develop the backward recursive equation, and use it to find the optimum solution. 10.3 Selected DP Applications 405 12 14 3 3 FIGURE 10.3 Network for Problem 3, Set 10.2a 2. For Problem 2, Set 10.1a, develop the backward recursive equation, and use it to find the optimum solution. *3. For the network in Figure 10.3, it is desired to determine the shortest route between cities 1 to 7. Define the stages and the states using backward recursion, and then solve the problem. 5 6 12