Need a c++ program of the given task

Task 1: In a 2x2 Sudoku puzzle, there are 4 connected 2x2 grids and t from the set V = {1, 2, 3, 4), such that each number appears ex any row, and exactly once in any column. Below is a diagram possible solution state. 4 2 1 Write a program that takes an empty 2x2 grid as input and fills backtracking. ed 2x2 grids and the objective is to fill the grid with numbers umber appears exactly once in the same grid, exactly once in low is a diagram depicting an empty 2x2 Sudoku and a 4 1 3 2 2 3 4 1 1 4 2 3 3 21 4 | as input and fills it to reach a valid solution state using Task 1: In a 2x2 Sudoku puzzle, there are 4 connected 2x2 grids and t from the set V = {1, 2, 3, 4), such that each number appears ex any row, and exactly once in any column. Below is a diagram possible solution state. 4 2 1 Write a program that takes an empty 2x2 grid as input and fills backtracking. ed 2x2 grids and the objective is to fill the grid with numbers umber appears exactly once in the same grid, exactly once in low is a diagram depicting an empty 2x2 Sudoku and a 4 1 3 2 2 3 4 1 1 4 2 3 3 21 4 | as input and fills it to reach a valid solution state using