A number of different-sized frisbees are stacked. A sorted frisbee stack is defined as having the smallest frisbee on top, the second smallest frisbee under the smallest frisbee, etc. The only tool provided is a shovel that can be used to flip any top partition of the stack (e.g., the top frisbee, or the top two frisbees, or the top three frisbees, and so on), including the entire stack. Note that there only ever exists one stack of frisbees, not multiple smaller, independent stacks. Larger frisbees may be on top of smaller frisbees and vice versa during the sorting. Assume that an arbitrary stack of n frisbees is represented as a Python list of numbers, with each number representing the size of the frisbee. When sorted, the smallest frisbee (with the smallest number) will be at index 0 in the list, and the largest frisbee will be at index n 1.Write a Python function named frisbeeSort that expects one argument, a possibly unsorted list of numbers representing frisbees, that uses the frisbee flipping technique described above to sort the list. Your function should return the sorted list.