Given n 0’s and n 1’s distributed in any manner whatsoever around a circle (see the following figure), demonstrate, using induction on n, that it is possible to start at some number and proceed clockwise around the circle to the original starting position so that, at any point during the cycle, we have seen at least as many 0’s as 1’s. In the following figure, a possible starting point is marked with an arrow.