7. We worked with a number of different algorithms for the eight queens problem. One was the "dumb" algorithm using a one dimensional array. A program to implement it could be structured like the following one. We generate all possible configurations of the array q, and print those for which the ok0 function returned true. bool ok(int q) f this function returns true if the array represents a solution ll and false otherwise. You will be asked to write it below