Python question

Problem: Three missionaries and three cannibals are on one side of a river, and they must cross a river using a boat which can carry at most two people, under the constraint that, at any time, missionaries cannot be outnumbered by cannibals. If they were, the cannibals would eat the missionaries. The boat cannot cross the river by itself with no people on board. (refer textbook problem 3.9) 1. Formulate the problem precisely Hint l: State can be represented by a three-tuple Hint 2: explain States, Initial State, Actions, Transition Model, Goal Test, Path Cost, etc. 2. Code and find a solution for this problem by using a. breadth-first tree/graph search b. depth-first tree/graph search 3. Derive the search graph for a) breath-first and b) depth-first Hint: need to show the order of node expansion Problem: Three missionaries and three cannibals are on one side of a river, and they must cross a river using a boat which can carry at most two people, under the constraint that, at any time, missionaries cannot be outnumbered by cannibals. If they were, the cannibals would eat the missionaries. The boat cannot cross the river by itself with no people on board. (refer textbook problem 3.9) 1. Formulate the problem precisely Hint l: State can be represented by a three-tuple Hint 2: explain States, Initial State, Actions, Transition Model, Goal Test, Path Cost, etc. 2. Code and find a solution for this problem by using a. breadth-first tree/graph search b. depth-first tree/graph search 3. Derive the search graph for a) breath-first and b) depth-first Hint: need to show the order of node expansion