Please write in python 
3. The Jealous Agents Problem (5 points) Three actors and their three agents are all mingling on the left bank of a river, and want to cross the river to the right back using a small boat, which is presently moored on the left bank. The boar is capable of holding one or two people at a time, but no more than 2. Each agent is very aggressive and when given the chance would (successfully) convince an actor to sign a new contract with the new agent ("poaching"). Poaching may occur when the boat is moored on either bank. Since each agent is worried their rival agents will poach their client, we adod the constraint that no actor and a different agent are on the same side of the river, unless the actor's own agent is also on that side of the river (no poaching is possible). If the actor's agent is not there but another agent is there, this is the situation in which poaching occurs. Poaching does not happen while the boat is crossing the river, but the passenger(s) must get out once the boat has crossed the river and moorss the other bank. For example Agent1 Agent2 Agent3I Actor1 | River I Actor2 Actor3 Actor2 and Actor3 have just crossed the river from left to right in the boat, and the boat is moored on the right bank. In the new state, no poaching can occur The next trip in the boat will be back to the left side of the river, with Actor2, Actor3, or both in it (None of these may be the successor of the start state which leads to the goal, or perhaps one is.) Write a program to perform depth-first and breadth-first search of the Jealous Agents problem. Do not generate new successors of states in which poaching carn occur. 3. The Jealous Agents Problem (5 points) Three actors and their three agents are all mingling on the left bank of a river, and want to cross the river to the right back using a small boat, which is presently moored on the left bank. The boar is capable of holding one or two people at a time, but no more than 2. Each agent is very aggressive and when given the chance would (successfully) convince an actor to sign a new contract with the new agent ("poaching"). Poaching may occur when the boat is moored on either bank. Since each agent is worried their rival agents will poach their client, we adod the constraint that no actor and a different agent are on the same side of the river, unless the actor's own agent is also on that side of the river (no poaching is possible). If the actor's agent is not there but another agent is there, this is the situation in which poaching occurs. Poaching does not happen while the boat is crossing the river, but the passenger(s) must get out once the boat has crossed the river and moorss the other bank. For example Agent1 Agent2 Agent3I Actor1 | River I Actor2 Actor3 Actor2 and Actor3 have just crossed the river from left to right in the boat, and the boat is moored on the right bank. In the new state, no poaching can occur The next trip in the boat will be back to the left side of the river, with Actor2, Actor3, or both in it (None of these may be the successor of the start state which leads to the goal, or perhaps one is.) Write a program to perform depth-first and breadth-first search of the Jealous Agents problem. Do not generate new successors of states in which poaching carn occur
