Can write down the two classes for code as simple as possible for second and third pictures as the example in first one

Light Switch Problem This week's exercise centres around a classic logic puzzle: A lot of switches I have a board of light svitches, numbered 0,1,2, ,1023. Each light svitch can be either on or off. Al1 svitches are initially off. Step 1: I flip all of the svitches starting at 0. At this point, all of the light svitches are on. Step 2: I flip every second switch, starting at 0. t this point, lights 0,2,4,6,8are off. Lights 1,3,5,7,9,.. are still on Step 3: I flip every third svitch, starting at o. So I flip svitches 0,3,6,9,12,... that is. if a svitch is on, I flip it to off. If a switch is off. I flip it to on. Step 1023: I flip every 1023'rd switch, starting at o. So I flip 0 and 1023 Question: At this point, which svitches are on and which are off? Solve the Problem Your first task is to try to solve the puzzle using nothing but your own brain (and possibly a pen & paper). Can you figure out the pattern? (there's a way of finding the answer without actually walking through 1023 steps). No... really... Solve the Problem 'mon give it a try. ,I'im sture half of you just jumped straight over the previous section to get to the "real" exercise. But really