void fib(int **sequence, int n){
 *sequence = malloc(sizeof(int) * n);

  if (n >=2){
    *sequence[0] = 0;
    *sequence[1] = 1;

    for(int i = 2; i < n ; i++){
      *sequence[i] = *sequence[i-2] + *sequence[i-1];
    }
      
  }
  else{
    for(int i =0; i < n; i++){
      *sequence[i] = i;
    }
  }
}
in a dynamically allocated array, generate the first n numbers of the fibonacci sequence