Q2. [5 points] 14. Alternating disks You have a row of 2n disks of two colors, n dark and n light. They alternate: dark, light, dark, light, and so on. You

want to get all the dark disks to the right-hand end, and all the light disks to the left-hand end. The only moves you are allowed to make are those which interchange the positions of two neighboring disks. Oox ∞∞∞∞●●●● Design an algorithm for solving this puzzle and determine the number of moves it makes. [Gar99]