Casse tte is a board puzzle that is defined as follows. Consider an nxn grid covered by n tokens (Figure 1(a), n = 4). The aim of this problem is to delete m < n tokens from the grid, such that each row and each column of the grid contains an even number of tokens (Figure 1(b) shows a feasible configuration with n = 4, m = 6; Figure 1(c) shows a non-feasible solution). (a) 1 0 1 0 0 1 1 0 1 11 1 0 0 1 1 (b) (c) (d) Figure 1 II. Not all instances of this problem are solvable. For example, the instance in which n = 4 and m = 5 has no solution. In fact, any instance having one of (m, n) odd and the other even has no solution. One way to represent the problem is using a two- dimensional binary array of size nxn, where a 1 represents a square with token, while a 0 represents an empty square. As an example, Figure 1(d) shows the binary representation corresponding to Figure 1(b). Project Description In this project, the students will write a program to generate and evaluate a Casse tte configuration concurrently. It is required that the program is implemented on at least a multi-core processor. The program should behave as follows. Note that there will be a shared variable. Proper synchronization methods must be implemented. The students are required to identify the shared variable as part of their deliverables in Phase 1. Phase 1: Grid Initialization- By the end of this step, the Casse tte grid has been randomly initialized and displayed. 1. The program will prompt the user to input the values of n and m. 2. The program will read and verify these values according to the conditions 3 n 6, m