CSE 232 Spring 2017 Programming Project #6 This project focuses vectors and their use. It is worth 50 points (5% of your overall grade). It is due Monday 1023 before midnight The Problem A ceular automaton(see https:/en wikipedia.o computing. It consists of a set of ceils, each of which is in either an on o off state, symbolized by the values 1 or 0 respectively. These cells can change heir state over time based on a set of update rules. The change of states of the cells can be used to do a kind of computing. Each cel is updated during each iteration of the algorithm, potentially changing the state of all the cells in the automaton r automaton) is specialized approach to The Game of Life The most popular cellular automaton you might have heard of is called "The Game of Life https://en.wikipedia.org wiki Conway %27s Game of Life) invented by the English mathematician John Conway in 1970.I is played on a two dimensional grid cells and the game-oflife update rule provides for a very complex, and entertaining. development of cell states over time Wolfram 1D cellular automata Stephen Woifram is an English mathematician/scientist who founded Wolfra, maker of Mathematica and Wolfram Alpha. He quantized the concep: of a 1D cellularautomaton as discussed here 1). The basic idea is this The simplest version of a D cellular automaton consists of the central cl, whose state might change during an iteration, and its two neighbors. We can construct 8 passible rules for update ofa cel based on the value of the central cell and its two neighbors We abel the rule based on a binary enumeration of the values of the 3 cells cel to neighbors update These are the possible patterns, but we now need to provide how the central cell changes for each of the 8 rules. We can do that by specifying nle mber, an 8-bit number, range 0-255, hat labels how the central cell should change for each rule based on a binary representation, in 8 bits, of that rule number. Consider the rule number 30 (used in the wolfram example). Its binary representation is 00011110. We mark below each of the 8 the rules the binary value of the rul number. This hinary value indicates, if that rule applies, the value (0or 1) the central cell takes on in the next iteration