2. The missionary and cannibals problem: Three missionaries and three cannibals are on one side of the river, along with a boat that can hold one or two people. Find a way to get everyone to the other side without ever leaving a group of missionaries in one place outnumbered by the cannibals in that place. Formulate the problem as a state-space search problem, and solve the problem by a suitable searching strategy using Python, and report the path found