Solve the pancake sorting problem with the initial state of 2,1,3,2 and the final state of 1,2,2,3. Note that there are two pancakes of size 2 to reduce the number of states needed. The arc-cost is the number of pancakes flipped.

a. Apply A* search using the heuristic h1 = the index of the largest pancake that is out of place.

b. Apply A* search using the heuristic h2 = the number of pancakes out of position.

c. Apply UCS

Use graph search (keeping track of closed nodes) wheneverapplicable; that is, in your work, do not show children that are found in the set of already closed nodes.