$7\mathrm{.}2$ 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?