You have a row of 2n disks of teo colours n dark and n light.they alternate :dark,light,dark,light soon. You want to get all the darks to the righy hand end and all the light disks to left hand end the only moves you are allowed to make are those that interchange the postions of the two neighbouring disk design an algorithm for solving this puzzle and fetermine the number of moves it makes