There are S students who are held as captives by a despotic teacher inside a Mahindra University. The teacher is incharge of a Turing Machine Lab with S $+1$ computers. The students are held in isolated rooms, and talking to each other is impossible. Each day, the teacher picks a student at random and takes

the student to the lab, where he$/$she can turn a computer ON or OFF as per his$/$her desire or just leave it in the state it is in$.$ Nobody else can enter the lab except the student that the teacher picked. The teacher picks the students uniformly at random, and for any number N$,$ each student is guaranteed to be

taken to the lab at least N times. The despot tells the students that any student can assert that all the students have visited the lab. If the assertion is false, they will be asked to take a graduate$-$level course, HPC$,$ taught by the teacher. If it is true, all the students are freed to get along with their interesting lives where they spend solitary lives inside their rooms in the hostels of Mahindra University. The students are allowed to talk to each other once in the beginning and come up with a strategy. Find a strategy for the students when the initial state of the computers is OFF