Exercise 4.2: A light bulb is controlled by n switches. Each switch can be in one of two possible statesOFF and ON. We cant tell the status of a switch (i.e., whether it is ON or OFF) at any given time. We can only toggle it between the two states by pressing the switch. Only when all switches are in the ON state, the light bulb will glow, otherwise it will not glow. Given that the light bulb is not initially glowing, give a recursive algorithm to make it glow. What is the number of operations (as a function of n) needed by your algorithm in the worst case? (Count each toggle of a switch as one operation.)