Write a Lisp program to solve the Missionaries & Cannibals problem using depth-first search. Your program should be invoked by the function call > (mac start end) where start is the current state of the problem and end is the desired goal state. Your program should output the sequence of moves necessary to solve the problem, or nil if no solution exists.