Your goal will be to return an array/list of length M, a sequence of booleans indicating which wire sets should and should not have current flowing through them. HINT: Consider the light bulbs of the wire set in the middle first []. I claim that it is "easy" to determine only for those rows that contain light bulbs in that particular wire set all the different ways to satisfy the requirements of the game. There are now two different disjoint problems to consider: What configurations are possible for the "small" wire sets and what configurations are possible for the "large" wire sets? Finally, given all of these possible configura- tions, how can you determine what the final possible configurations are? If you are writing the file in Java: Student Solver.java should have a function with the header public static ArrayList solve (ArrayList bulbs) If you are writing the file in Python: studentsolver.py should have a function with the header def solve (bulbs): If you are writing the file in C++: Student Solver.h should have a line with the header static std::vector solve (std::vector bulbs); 4 Example -1, -1, -1 13, -9, -14 1, -7, -2