The Missionaries and Cannibals Problem is stated as follows. Three missionaries and three cannibals are on one side

1.The Missionaries and Cannibals Problem is stated as follows. 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 outnumbered by cannibals in that place.

write the program that will search for the solution to Missionaries and Cannibals Problem. (list the content of the frontier and the list of explored nodes for the first 5 steps of each of the strategies used  :

(a) uniform-cost search; (b) iterative deepening search; (c) greedy best-first search; (d) A* search and (e) recursive best-first search.

2. Searching for Road Trips in the U.S.A.  

 find the solution and return a simulation of the RBFS strategy by generating automatically the following five values: (1) f_limit; (2) best; (3) alternative; (4) current-city; and (5) next-city for each node visited. 

 find the solution to the same search which implements the A* algorithm. Make sure that the program lists the contents of the frontier and explored list for each node that you visit during search .