This has to be coded in Python only. The game will display a square grid, with the columns labeled with letters, and the rows with numbers. Elements within the grid will be associated with pairs of integers $($a pair of $0$s$,$ and pair or $1$s$,$ a pair of $2$s$,$ etc.$).$ Initially, we will not be able to see any of the numbers, as they will be hidden by $$X$$ symbols. The title $$Brain Buster$$ is displayed first. $$ Next, we have the grid. Column names use letters $($A to D in this case$),$ while rows are labeled with numbers $(0$ to $3$ in this case$).$ Any individual cell in the grid is identified by a letter$/$number combination $($e$.$g$.,$ A$0,$ B$2).$

Again, when we start a new game, all we see is a grid of X symbols. Our job is to find the pairs. We will do this primarily by selecting Menu Option $1,$ which will allow us to specify a pair of cells to test. When we do this, we will be prompted to enter the first cell $($using the letter$/$number format$)$ and then the second cell $($i$.$e$.,$ there will be two separate input prompts, one for each cell$).$ Note that column letters may be given either as upper case or lower case.In this case, the two numbers will remain visible for $2$ seconds, at which point they will be replaced by X$$s again., if the two cells match, then the numbers will remain visible and the player continues to search for other pairs. It is also possible for a player to manually turn cells over if they want to solve the game a little more quickly. To do so$,$ they will select Menu Option $2.$ Using Menu Options $1$ and $2($but mostly Option $1),$ the player will work through the grid until she$/$he has uncovered all of the pairs in the grid. At that point the game will indicate that the player has won and will provide a score. Basically, the score reflects the number of guesses actually taken versus the minimum number actually required. The score itself is a very simple calculation, and is computed as follows: Score $=($minimum$\_$possible$\_$guesses $/$ actual$\_$guesses$)*100.$ Note: Using Option $2$ counts as two guesses, so using it a lot will produce a very low score. Menu Option $3$ is entitled $$I give up $$ reveal the grid$.$ In short, this ends the game and displays all hidden numbers. t the program must have basic error checking. Otherwise, the program will fail constantly, as the player accidentally inputs a bad selection. The error checking includes: $1.$ Check the command line argument to make sure that a $2,4,$ or $6$ has been specified. The program can be stopped immediately if the grid size is invalid. $2.$ Check the menu option selections. It must be a number between $1$ and $5.$ If a bad selection has been made, the player must be informed and asked to enter the option again $($the program should NOT just stop$).3.$ The cell coordinates must be verified to ensure that the column $($a letter$)$ and the row $($the number$)$ are valid for this grid. If not, the player should be informed and asked to enter the cell$($s$)$ again. The image below illustrates user feedback when invalid entries are made. Note as well that the player should not be able to enter the same cell twice when making a guess $($e$.$g$.,$ a$0$ and a$0).$ This will make things easier for you. Menu Option $4$ is to start a new game, and option $5$ is to exit. $```$

$|$ Brain Buster $|$

$[$A$][$B$][$C$][$D$]$

$[0]$ x x x x

$[1]$ X x x x

$[2]$ X X x x

$[3]$ x x x x

$1.$ Let me select two elements

$2.$ Uncover one element for me

$3.$ I give up $-$ reveal the grid

$4.$ New game

$5.$ Exit

Select:

$```$