an enhanced version of bubble sort, called Cocktail Sort (CS), and its complementary version, denoted by CS-R. The main idea of CS is to alternate the following two procedures: (P1) bubbling the largest to the right (starting from the leftmost item), (P2) bubbling the smallest to the left (starting from the rightmost item), and then fix the leftmost and rightmost items and iteratively continue on the remaining part. The CS-R acts in a way contrary to CS, and additionally, it takes another (n) to convert the reversely-sorted into sorted, where n denotes the input size. Consider such an input instance: (27,17,3,16,13,10,1,5,7,12,4,8,9,0). Please state the outputs row by row when applying CS and CS-R to the instance. Please use two tables each for CS and CS-R such that the first row is the input array and then followed by rows are what obtained after applying (P1) and (P2) alternatively (or the reverse version as shown in CS-R). You need not state the pseudo codes here. (10 Points)