This is also known as the Francs problem You are given two A2 coins and two A5 coins that are initially arranged as shown below. The purpose of the game is to make a sequence of simple maves to bring the coins into the final position: 2 R2 A coin can be moved by either sliding it to the empty square next to it, or by jumping over another coin into an empty square. The R2 coins can only be moved to the right, and the R5 coins can only be moved to the lett. No backing up is allowed. Write a Prolog program to find a sequence of legal moves to bring the coins from the given initital state to the final desired state using a breadth-first search. This is also known as the Francs problem You are given two A2 coins and two A5 coins that are initially arranged as shown below. The purpose of the game is to make a sequence of simple maves to bring the coins into the final position: 2 R2 A coin can be moved by either sliding it to the empty square next to it, or by jumping over another coin into an empty square. The R2 coins can only be moved to the right, and the R5 coins can only be moved to the lett. No backing up is allowed. Write a Prolog program to find a sequence of legal moves to bring the coins from the given initital state to the final desired state using a breadth-first search