Write a function that takes as an input a number $\text{'}n\text{'}$ and returns a vector containing $n$ numbers of the Fibonacci sequence. Assume that the input $n$ is an integer equal to or greater than $2.$ Run the function for inputs: $2,7$ and $9.$

Recall: The Fibonacci sequence follows the trend

$n_i=n_{i-1}+n_{i-2}$

Hint: Use if statements to generate the vector if the sequence is $1$ or $2$ numbers long.