same mountain could not be visited in any two consecutive days. Use DP to plan as we could. We also Dulll day and to camp at the base of the inbing the next day. Additionally, we decided that the the 5-day hike. 12-3. For Problem 12-1, develop the backward recursive equation, and use it to find the optimum solution. 12-4. For Problem 12-2, develop the backward recursive equation, and use it to find the optimum solution cities 1 to 7. Define the stages and the states using backward recursion, and then solve the problem. 12 FIGURE 12.9 Network for Problem 12-5 5 6 2. 4 14 12 0 1 3 3 7 6 6 9 4 Do Exercise 12-5 0 2 IZ 12 12 6 s 14 3 (7) = 14 D to 4 1 6 6 6 7 4 9 41) 9 2 1 1 3 4 Beck ward