PROBLEM 6: In the puzzle game sudoku we have a 9x9 grid which must be populated with integers in (1..9}. In a correct solution each row, column must contain each value in 1..9 exactly once (there are also 9 3x3 sub-grids that must obey the same rule). We want a function which takes an integer array of length 9 representing a sudoku row and determines if it is "ok" or not according to the rule above; it should return true or false accordingly. Below is an attempt at solving this problem // array row is assumed to be of length at least 9 bool sudoku row ok (int row]) int sum=0; int i; for (i=0; i 9)