7. Use both the “plain vanilla” branch and bound, and branch and bound with dynamic programming, to get from the start node (S)

to the goal node (G) in parts

(a) and

(b) of Figure 3.31. When all else is equal, explore nodes in alphabetical order.