Need help with C

clear explannation for def upvote

Thank you!

In this assignment we define a cellular automaton, CA, as a model of a colony of "cells" with the following characteristics: - The cells are in a one-dimensional structure (implemented using the 64-bits of an unsigned long integer, with one bit for each cell) - Each cell has one of two possible states: 0 or 1 (otherwise referred to "dead" and "alive", correspondingly) - Each cell has a neighborhood formed by the cell itself and its two adjacent neighbors: one to the left and one to the right Starting with an initial pattern, the automaton simulates the birth and death of future generations of cells using a set of simple rules. Updating a single cell's state must be accomplished using a bitwise operation. The colony evolves using a ruleset. The ruleset, based on the state of a cell and its neighbors in the current generation, determines the state of each cell in the next generation. Since a neighborhood is defined to have exactly three cells, it is effectively a 3-bit number. This means there are only eight possible neighborhood configurations, and we can assign an outcome for each. The following table defines one possible ruleset: To easily identify rulesets, each ruleset is named after the corresponding two hex digits formed by its outcomes. As such, what we have just defined is ruleset 5A. Note: When dealing with the cells on the edge who don't have a neighbor to both their left and their right, assume that the missing neighbor has a constant state value of 0 . Starting with an initial generation, a colony of cells each with a defined initial state, the following figure shows how one generation advances to the next when applying ruleset 5A with each new generation appearing below the previous one. Starting with an initial generation, a colony of cells each with a defined initial state, the following figure shows how one generation advances to the next when applying ruleset 5A with each new generation appearing below the previous one. Initial State and Default Ruleset In the initial state of the colony (i.e., Generation 0 ), all cells have a state of 0 except for the middle cell, which should has a state of 1 . The middle cell corresponds to the 32nd bit. If no command-line argument is given, the program should use ruleset 5A. Otherwise, the program should use the ruleset given by the command-line argument. Deliverables A file named automata. c containing the ANSI C source code