Java Program Assignment: Read in the size of an array from the user, then read in initial values into that array, accepting ONLY zeros and ones. To be more precise, any number not a zero should
be entered into the array as a one. Now proceed through 20 steps of a “cellular automata”,
where the rule to create one stage from the previous is:
1) If a cell has a "1" in it, and it is surrounded by two other "1"s, it dies (becomes a zero)
due to overcrowding.
2) If a cell has a “0” in it, and it is surrounded by two other "1Is, a new “1” is born there (as
a child of the two "1"s.
3) If a cell has a "1" in it, but is surrounded by zeros, it dies from starvation (or loneliness).
4) If a cell has a "0" in it, and one of its adjacent cells has a "1", then it becomes a “1” (think
of the spread of mold, or an increase in population of an animal).
5) If none of the rules above apply, the cell remains as it was.
6) Edge cells (the ones at the ends of the array) are treated as if the "missing" cell was a
zero.