Objective: Review C$++$ basics, including file I$/$O$,$ user$-$defined functions, $2$D arrays, loops and branching. Descriptions: For this project, you will complete the provided partial C$++$ program that implements a modified version of John Conway's Game of Life cellular automata simulation of a biological system. In our version, there are two different types of living cells, Type$1$ and Type$2,$ that may evolve based upon the rules summarized below. The simulation consists of a square grid of cells $($hint: $2-$D array$)$ where each cell is either dead or alive. The current arrangement of living and dead cells is used to compute the next generation of cells using the following rules that determine the Birth, Survival, and Death of each cell. Survival Rule A living cell survives if it has some specified number of living neighbors of the SAME type. Hint: If a living cell does not survive, it dies! Death Rule A living cell will die if it has too few neighbors of the SAME type $($loneliness$)$ or too many neighbors $($overcrowding$).$