1. (5 points) LO3, Consider the quilt of hexagonal patches discussed in the class. Design an algorithm to determine the number of blue patches given the input and output below. Algorithm Blue Patches 1: Input: A sequence of colors (red, green, blue) for n 2 hexagons 2: Output: The number of blue patches 2. (5 points) LO3. Design an algorithm that takes a list of cyclically right shift the input list by s positions, where 1 is 3, 4, 12, 9, 8, 7 and a 3, the output must be 9, 8, 7, 3, 4, 12. Justify if it is a valid algorithm. You must not use an extra array other than that needed to store the input list. 3. (5 points) LO4. From the algorithm below, work out the counts of basic operations C(n) and its the growth order. Algorithm Mystery 1: Input: Positive integer n 2: Output: 3: 14-0 4 for i:=1 to n - 1 do 5: integers and produces an output list that n-1. For example, suppose your input for ji+1 to n do for k:=1 toj do rir+1 6: 7: 8: return/