void fib(int n, int count)
{
    // Introduce array to store first n values in Fibonacci sequence
    int *fib_array[n];

    // The first 2 Fibonacci numbers will be fixed.
    int *fib_array[0] = 0;
    int *fib_array[1] = 1;

    // The rest will iterate over the first 2 Fibonacci numbers, 0 and 1.

    for (int i = 2; i <= n; i++)
    {
        // Also given in the question description:
        *fib_array[i] = *fib_array[i - 2] + *fib_array[i - 1];
    }
}
 Define a function void fib(...) below. This function takes parameter n
 * and generates the first n values in the Fibonacci sequence.  Recall that this
 * sequence is defined as:
 *         0, 1, 1, 2, 3, 5, ... , fib[n] = fib[n-2] + fib[n-1], ...
 * The values should be stored in a dynamically-allocated array composed of
 * exactly the correct number of integers. The values should be returned
 * through a pointer parameter passed in as the first argument.
 