Do the problem as Described, solve the problem on computer and plot with command discreteplot and you are also require to send me the code and the output screenshot also plz also give proper description as needed:

3. Consider totalistic ID rules with 3 colors and nearest neighbors (one to the left and one to the right). Totalistic means the next state in the middle cell only depends on the sum of the 3 cells. The colors are black (-2), grey (-1) and white (0) so the sum goes from 0 to 6. Consider now the rule 1074. Write 1074 in base 3 (command is BaseForm) so you can understand how the rule works. Run it for 100 iterations starting with one black cell in the middle of long white string. Repeat it for one grey cell. Do the figures look the same. You have to modify the program somewhat, see the command CellularAutomaton.\f