This is all of the details that I am given.

Problem 1: Use the "plain vanilla" branch and bound, branch and bound with underestimates, 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. [30 Points, 15 points each] a) 3 11 Problem 1: Use the "plain vanilla" branch and bound, branch and bound with underestimates, 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. [30 Points, 15 points each] a) 3 11