Develop and implement a stack-based Sudoku puzzle solver in C++. Using the following two algorithms,

Algorithm 1 The main Sudoku algorithm Preconditions board contains an unsolved Sudoku puzzle Postconditions board contains a solved Sudoku puzzle 1: procedure SoLVE 2: Select the best empty cell and place its location on the stack 3 while true do 4: Let (i,j) be the location on top of the stack Select the next valid choice for board[i]j] if no such choice exists then 5: 6: 7: 8: 9: 10: Mark board[i][j] as not filled in Pop the stack if the stack is empty then Return: the puzzle has no solution end if 12: 13: continue end if Select the best empty cell and place its location on the stack if no such cell exists then 14: 15: 16: 17: 18 end while Puzzle is now solved break end if 19 Output the solution 20: end procedure