The chain problem (Figure 3.20, p89) consists of various lengths of chain that must be reconfigured into new arrangements. Operators can open one link and close one link. In the standard form of the problem, the initial state contains four chains, each with three links. The goal state consists of a single chain of 12 links in a circle. Set this up as a formal search problem and find the shortest solution. (1) Set this up as a formal search problem (2) Using the CODE REPOSITORY, use one of the _uninformed_ search algorithms to find the shortest solution Extra Credit: (3) Using the CODE REPOSITORY, use Bi-Directional Search to find a shortest solution Assignments must be turned in in LISP. The TAs will be providing instructions on how to turn them in.