MINI PROTECT

TASK $1$: Write a python program to simulate the missionaries and cannibals' problem.

Description: The missionaries and cannibals' problem, which is a famous problem in AI$,$ is usually stated as follows. Three missionaries and three cannibals found themselves on one side of a river. All of them have to move to the other side. The only boat available for communication can carry maximum two of them at a time. One of them must comeback to get the boat on the side where others are waiting. Another condition is$,$ at no point of time, the missionaries should be less than the number of cannibals on any side of the river $($otherwise they will eat those missionaries$).$

Find a way to get everyone to the other side, without ever leaving a group of missionaries on one side outnumbered by the cannibals.

TASK $2$: Write a python program to implement Informed Search Technique: A$*$ Algorithm

Note: Submit the source code implementation and attach the screen shots of program output.