For this question, your task is to impelement the Water Jugs problem as a search problem.

You have been provided with several Python files. These include a generalized, object$-$oriented imple$-$

mentations of the basic search algorithms below:

$$ Breadth$-$first $($BFS$)$

$$ Depth$-$first $($DFS$)$

$$ Iterative$-$deepening $($IDS$)$

Each of the algorithms above can be run using either the Tree search or Graph search variants.

The only file you need to CHANGE is WaterJugs.py$.$ This file implements both the State and Problem

classes that are used by the search algorithms. The provided version of WaterJugs.py contains only

method headers. You need to implement these methods correctly to capture the specific dynamics of

the Water Jugs problem, using your understanding of search problem encoding and of AIMA Chapter $3.$

When you are done, you can test your implementation by running see$\_$solutions.py with the following

arguments