Hello! I was stuck at this question and I'm very new to Python languages, can you help me to solve this problem with code using Python? So that I can get a head start for the following question. Ignore the folllowing task 1.1 and so on. Thank you so much.

Implement the function mnc_tree_search with Tree Search using your proposed representation described in Tasks 1.1, 1.2 and 1.3. mnc_tree_search takes two integers m and c, which are the numbers of missionaries and cannibals on one side of the river initially, and returns the solution to the problem as a tuple of steps. Each step is a tuple of two numbers m and c, indicating the number of missionaries and cannibals on the boat respectively as the boat moves from one side of the river to another. The odd steps are for the boat moving from right to left and the even steps are for the boat moving from left to night. Note that 1= no. of cannibals) - Step 3: 1 cannibal and 1 missionary row the boat to the RHS of the river - End: 2 missionaries and 1 cannibal are on the RHS of the river CS Scarmed with CarnScatner