(Firing in a Line of CA with 6 States) () Finite cellular automata (CA) can only have a constant memory size, which means they cannot store a counter. The goal is thus to solve the firing squad problem with the least amount of time and to do so with the least amount of memory. The measure we use for the memory is the max number of different values that can to be stored in the memory, and it is called the number of states of the automaton. Consider a line ofCAwith only one initiator (located at the end of the line). Develop a solution that uses only six states.