Can you comment on the things you do for me to further understand the topic (thank you)

Obiective: Part of the Code for a Reversi Game The goal of this lab is to write a program that will be used (in Lab 7) as part of a Reversi game, as well as a little bit of the 'thinking' code that will be used in that lab to have the computer plav against a human opponent. Here is a brief description of the full Reversi game. Reversi is played on a board (like a chess board or a checkers board) that has dimensions n n, where n is even. In the picture below n - 4. The game uses tiles that are white on one side, and black on the other side (they can be "flipped" over to change their colour). One player plays white; the other player plays black. The picture below shows the initial board configuration, which has two white and two black tiles placed in advance at the centre. Observe that rows and olumns are labelled with letters Figure 1: Starting positions on the Reversi game board. A "turn" consists of a player laying a tile of his/her own colour on a candidate empty board position, subject to the following two rules: 1. There must be a continuous straight line of tile(s) of the opponent's colour in at least one of the eight directions from the candidate empty position (North, South, East, West, and diagonals) 2. In the position immediately following the continuous straight line mentioned in #1 above, a tile of the player's colour must already be placed. After playing a tile at a position that meets the above critera, all of the lines of the oppo- nent's tiles that meet the criteria above are flipped to the player's colour In the picture below, all of the candidate positions for White's next move are shown shaded Figure 2: All of the candidate positions for White's next move If the White player decides to play at row c, column a, the Black tile at row c, column b is flipped and the board looks like this: Figure 3: White plays at row c, column a The picture below shows the possible move positions for the Black player: Figure 4: All of the candidate positions for Black's next move after White plays at (c, a). If the Black player lays a tile at (b, a), the board appears like this: Figure 5: Black plays at (b, a) Finally, if the White player lays a tile at (a, c) the board appears like this OlO Figure 6: White responds to Black by playing at (a, c) Note that in White's move, two lines of Black tiles were flipped: the line directly to the South, and the line to the South West The turns alternate between the players, unless one player has no available move, in which case the only player with an available move is allowed to continue to make moves until a pponent is allowed to take a turn and the alternating turns between the players resumes. The game ends when either: move becomes available for the opponent. At this point, the o 1) the entire board is full, or 2) neither player has an available move For this lab, you will implement part of the game-playing functionality. You will complete the game in Lab 7, using the functionality you have built in this lab, so please be mindful to build clean and re-usable code for this lab You will write a C program that will do the following: (Note that the specific details of input and output will be given in the example runs below this section.) 1. The first input to the program will be n, giving the size of the n x n board. You may assume that n will be an even number and will never be larger than 26, and allocate memory dynamically or to declare variable-length arrays. Your program should initialize the should declare a static 2-dimensional array. There is no need to board as shown above and print it 2. The next sequence of inputs will describe a board configuration, representing a sit- uation part-way through a game of Reversi. Each line of input will consist of three characters with no spaces in between. The first character will be a colour: B or W; the second character will be the row (a - z); the third character will be the column (a - z). The three characters represent a tile of the specified colour placed at the specified row and column. The three-character sequence !!! ends the board configuration en- try phase. Character arithmetic can be used to translate the rows/columns into array a' equals 1. Note: your program should not check for move legality during this phase. This phase is simply to input an intermediate board indices, e.g. b configuration. 3. Then, your program should print a list of the available moves for the White player, followed by a list of the available moves for the Black player, given the board con- figuration input in the previous step. The available moves for each player should be printed in the order of increasing rows, then in the order of increasing columns (for available moves in the same row) 4. Next, your program should ask the user to input a move, represented in the same three-character format. Your program should check if the move is valid, and if so make the move, flipping the tiles correspondingly. If the move is invalid, your pro- gram should indicate so 5. Your program should print the final board configuration and terminate Your program must use the following characters to represent the state of each board posi- tion: U - for unoccupied B occupied by black W occupied by white For example, after the entire board above is entered, it would be printed as follows: abcd a UUWU b BWWU c WWWU To print the board, your program should contain a function with the following prototype void printBoard (char board ][26], int n); where board is the 2D array representing the current board state, and n is the board di- mensions Here is an example execution of the program Enter the board dimension: 4 abcd b UWBU C UBWU Enter board configuration Bba Bac abcd a UUBU b BWBU c WBWU Available moves for W: bd db Available moves for B: cd da Enter a move: Wdb Valid move abcd a UUBU b BWBU c WWWU d UWUU Here is another example execution of the program where the final move is invalid Enter the board dimension: 6 abcdef c UUWBUU d UUBWUU Enter board configuration Bbd Bad Wde abcdef a UUUBUU b UUUBUU UWWBUU d UUBWWU Available moves for W: ae bc db ed Available moves for B: ba bc db df Enter a move: Bbe Invalid move abcdef a UUUBUU b UUUBUU UWWBUU d UUBWWU We strongly encourage you to break up your program into separate functions, and to care- fully test each function separately, before connecting it into the larger program. To help s, you are required to create the following helper functions and use them in your implementatiorn bool positionInBounds (int n, int row, int col); which checks whether the specified (row, col) lies within the board dimensions. It is very error prone to write separate code to check each of the eight possible line direc- tions that begin at a given tile. To simplify this, you are required to write and use the following function: bool checkLegalInDirection (char board[][26], int n, int row, int col, char colour, int deltaRow, int deltaCol); which checks whether (row, col) is a legal position for a tile of colour by "looking" in the direction specified by deltaRow and deltaCol. deltaRow and deltaCol take on values of -1 0, and 1, with the restriction that they cannot both be O. For example, if deltaRow = 1 and deltaCol - 0, the function searches the South line. If deltaRow - -1 and deltaCol - 1, th