Write a program to find the Fibonacci numbers where each number is the sum of the two preceding ones, starting from $0$ and $1.$

e$.$g$.$

$0,1,1,2,3,5,8,...$

Ask a user to enter a number. Next, generate user specified number of Fibonacci numbers into a list. Then print out the list. The output should look something like this:

How many Fibonacci numbers would you like to generate? $10$

$10$ Fibonacci numbers are $[0,1,1,2,3,5,8,13,21,34].$