2>The original array that is passed in, is not a part of that cycle.
Here's a generalizable way to approach this problem w/o having to have a ton of insight:
there are 8 cells so there are 2 ^ 8 = 256 possible cell configurations
therefore, after 256 transformations you are guaranteed to observe a cycle by the pigeonhole principle:
In the future when you see questions where you have to make a large amount of state transitions over a state space that seems small, just compare the size of the state space to the # of transitions to determine if there's a cycle so you can bound complexity to the size of the state space.