The missionaries and cannibals problem is a good example of a puzzle that can be analyzed according to the search superstructure given above. the problem involves three missionaries and three cannibals, all six of whom are originally on one side of a river. there is one boat that will be used to ferry the missionaries and cannibals to the other side of the river. the boat holds two occupants at most, and there is no way to send the boat across the river without having at least one occupant in the boat. the threat is that, if the cannibals outnumber the missionaries in any circumstance, then the cannibals will cook and eat the missionaries (so the fable goes). use the search superstructure to design a prolog program that searches for ways to ferry all six persons to the other side of the river. suggestion: use state representation [m, c,b] where m is the number of missionaries and c is the number of cannibals on bank b. the start state is [3,3,left], and the goal state is [3,3,right]. write specifications for 'start', 'goal', 'next_state' and 'safe_state', and add them to the search superstructure to obtain a complete program to solve this puzzle. your program should be able to calculate two distinct minimal solutions each involving eleven boat trips across the river.