1. You have a sequence of 2n alternating ones and zeros (for instance, n = 5: 1010101010). Design an algorithm (write a Python program or pseudocode) for rearranging zeros and ones so that the new sequence contains all zeros are on the left and all ones are on the right. The only moves you are allowed to make are those that interchange the positions of two neighboring digits. Determine the number of moves it takes