• For the water jug problem (4-gallon and 3-gallon) with2-gallon goal, how many states are possible? 8 state arepossible.

• What is the start state and the goal state for the water jugproblem (4-gallon and 3-gallon)?

• For the water jug problem (4-gallon and 3-gallon) with 2-gallongoal, how many legal state transitions are possible?

• Write the outline for an algorithm that takes a water state asan input and generates each legal successor state.

• How would you prevent revisiting the same state more than onceif you attempted to use your algorithm to move from the start stateto the goal state?