Write a program in the language of your choice that uses search to formulate plans for moving from one arrangement of three blocks to another. Assume that the available actions that can be taken are to move a block from one of three locations to another, and that if one a block is placed into a location in which another block is already present, then the second block is placed on top of the first block.