Please write a full answer and give a good explanation!

Sorting 9. Suppose you are given a stack of n pancakes of different sizes. You want to sort the pancakes so that smaller pancakes are on top of larger pancakes The only operation you can perform is a flip-insert a spatula under the some integer k between 1 and n, and the top k pancakes, for some integer k between 1 and n, and flip them all over. Figure 1.17. Flipping the top four pancakes. Exercises (a) Describe an algorithm to sort an arbitrary stack of n pancakes using O(n) flips. Exactly how many flips does your algorithm perform in the worst case?14 [Hint: This problem has nothing to do with the Tower of Hanoi.] (b) For every positive integer n, describe a stack of n pancakes that requires S2(n) flips to sort