1. A number of different sized pancakes are stacked. A sorted pancake stack is defined as having the smallest pancake on top, the second smallest pancake under the smallest pancake, etc. The only tool provided is a spatula that will flip any top partition of the stack, including the entire stack. Note that there only ever exists one stack of pancakes, not multiple smaller, independent stacks. Larger pancakes may be on top of smaller pancakes and vice versa. ) If every flip took on un of cmpete, exaety howmany Rip or units of time sre required in the worst-casei.e, for the worst-case arrangement of pancakes) to sort the stack? Aim for a good algorithm. Express your answer, T(n), as a function of the number of pancakes. Make your answer easy to find in the comments for your solution to part b, below