Please help solve! I will upvote, Thank you!!

Ex.2 (Sorting Tortillas) In the Famous Chef's Restaurant, they make (circular) Tortillas of all different sizes for the demanding customers. The Chef faces the following problem and needs your help. In front of you is a stack of n tortillas of different sizes. You want to sort the tortillas so that smaller tortillas are on top of larger tortillas. Unfortunately, you are not allowed to touch any food, but you have a spatula with which you can perform a "flip" operation: insert the spatula under the top k tortillas, for any integer k you choose between 1 and n, and flip them all over. See Figure 1. Describe an algorithm to sort an arbitrary stack of n tortillas using O(n) flip operations with the spatula. Follow-up question: Exactly how many flips does your algorithm perform in the worst case? (Hint: This problem has nothing to do with the Tower of Hanoi.) Figure 1: Sorting Tortillas: We flipped the top 4 tortillas using the spatula. So for this flip operation k was equal to 4