Consider the following graph. Find the shortest route from S to T by the dynamic programming approach. For the graph shown in Figure 7-1, solve the same problem by using the branch-and-bound approach. For this problem, which approach (dynamic programming versus branch-and-bound) is better? Why? Consider the following graph. Find the shortest route from S to T by the dynamic programming approach. For the graph shown in Figure 7-1, solve the same problem by using the branch-and-bound approach. For this problem, which approach (dynamic programming versus branch-and-bound) is better? Why