void fib(int **fib_sequence, int n) {
    fib_sequence = malloc(sizeof(int) * n);
    for(int i = 0; i < n; i++) {
        if(i == 0) {*fib_sequence[0] = 0;}
        else if(i == 1) {*fib_sequence[1] = 1;}
        else {*fib_sequence[i] = *fib_sequence[i-2] + *fib_sequence[i-1];}
    }
}

int main(int argc, char **argv) {
    /* do not change this main function */
    int count = strtol(argv[1], NULL, 10);
    int *fib_sequence;

    fib(&fib_sequence, 2);
    for (int i = 0; i < 1; i++) {
        printf("%d ", fib_sequence[i]);
    }
    free(fib_sequence);
    return 0;
}
store the first n values in the Fibonacci sequence in a dynamically-allocated array