1. There are s + 1 jackrabbits after the first breeding season.

2. If there were p_i jackrabbits after breeding season i and p_{i + 1} jackrabbits after breeding season i + 1, then there will be p_i + p_{i + 1} jackrabbits after breeding season i + 2.

For example, starting with

p₀ = 5

p₁ = 5 + 1 = 6

p₂ = p₀ + p₁ = 5 + 6 = 11

p₃ = p₁ + p₂ = 6 + 11 = 17

To aid the research, Prof. Fibonacci would like you, the laboratory computing specialist, to model a jackrabbit ecosystem. The model should be initialized with the integer start, the number of jackrabbits to start, and max, the maximum number of jackrabbits the ecosystem can support (because they have no natural predators, the jackrabbit population grows until they eat all available food). start must be an integer value greater than 0; max must be an integer value greater than or equal to start; you may assume that max - start <= 1000.

The model should support the following operations:

• seasons - accepts no arguments and returns the integer number of breeding seasons until the jackrabbit population equals or exceeds the maximum max.

• population - accepts as input an integer i, i >= 0, representing the number of breeding seasons since the start of the simulation and returns the integer number of jackrabbits at the end of breeding season i. If i exceeds the number of breeding seasons returned by seasons, population should return 0 (there are no jackrabbits because there is no food).

The professor would like to be able to run several versions of the model at the same time to allow for comparative analysis.

1. Describe the data structures you would use to model the jackrabbit ecosystem. For each data structure give the type, its name, and a brief description of its use. Don't forget that the professor will want to run several versions of the model at the same time.

2. Give the prototypes for each of the procedures associated with the model. Don't forget that the prototypes for seasons and populations must match the specifications given above. You may add any other procedures you feel are necessary to implement the model.

3. Describe the implementation of each procedure associated with the model. You need not write code; you may describe each step in the implementation with a brief sentence.

   You should describe each implementation in enough detail to show you understand the problem and you have some idea of how to solve it. If you are unsure about your answer, err on the side of providing too much detail rather than too little.