Each node is labeled with an ordered pair where the character is...

Each node is labeled with an ordered pair where the character is the node name and the integer is the node's value.

Starting with node B, trace through the Steepest-Ascent Hill-Climbing Search algorithm, answer the following questions:

1. What is the global maximum?  If there are any ties, pick one.

2. What is the global minimum?  If there are any ties, pick one. 

3. Are there any plateaus? If so, which nodes make up the plateaux?

4. In which order are the nodes expanded? Example: [N, J,M, O]

5. If the algorithm is unable to find the global maximum, where does it get stuck and why does it get stuck?

For any particular node, you can assume each node's successor will be expanded in alphabetical order.

If there is a tie in objective function values, pick the first one expanded. Steepest-Ascent chooses the best neighbor node found "so far".