The Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers$.$ The sequence commonly starts from $0$ and $1.$ Starting from $0$ and $1,$ the sequence grows like this:

$0,1,1,2,3,5,8,13,21,34,55,89,144,.........$

Given a number N as input, write an algorithm$/$code to compute$/$print the first N fibonacci numbers. N will be always less than $100.$ Describe the time and space complexity of your algorithm.

Example Input $1$:

$5$

Example output $1$:

$[0,1,1,2,3]$

Example Input$-2$:

$10$

Example output$-2$:

$[0,1,1,2,3,5,8,13,21,34]$