Pls write a c code

Part 2. Now write the isSingle function to manipulate these bit vector sets in efficiently comput ing a result needed when solving a Sudoku puzzle. The goal of Sudoku is to assign every cell in the grid a digit from 1 to 9 subject to the constraint that each digit can be used only once in each row, column, and block. (You can read about Sudoku in wikipedia if you're curious, but for the purposes of this problem, you don't need to know any more details). The isSingle function is given three bit vector sets representing the digits already used in the row, column, and block for a cell. The possibilities for a cell consist of only those digits that are unused; any digit that is already used in the row, column, or block is not a possibility. The function isSingle returns true if the already used digits force only one option for this cell (number of possibilities is exactly 1) and false otherwise (i.e. number of possibilities is 0 or 2 or more) bool isSingle(unsigned short used in row, unsigned short used in col, unsigned short used in block)