Problem 2: Use the "plain vanilla" branch and bound and A* algorithm to get from start node (S) to the goal node (G) in the following graphs. When all else is equal, explore nodes in alphabetical order. [20 Points, 10 points each] a) 3 1 3 Problem 2: Use the "plain vanilla" branch and bound and A* algorithm to get from start node (S) to the goal node (G) in the following graphs. When all else is equal, explore nodes in alphabetical order. [20 Points, 10 points each] a) 3 1 3