Missionaries and Cannibals Problem

Question description

I want to solve the missionaries and cannibals problem using 2 searches breadth first search and iterative deepening.The breadth first search I managed to implement it but the iterative deepening search I got stuck. Please can you implement the iterative deepening search for me so that it solves the missionaries and cannibals problem. I will send you the code for the breadth first search so you could use some methods from it if possible and then you join them for me in one program and the user will choose between breadth first search and iterative deepening.