In mathematics, the following integer sequence exists, which is characterized by the fact that every

number after the first two is the sum of the two preceding ones: use type aliases for this program

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

The first two terms are $0$ and $1.$ The sequence Tn of terms is defined by the recurrence formula:

Tn $=$ Tn$-1+$ Tn$-2,$

With seed values

T$0=0,$ T$1=1$

Write a program which uses for loop$($s$)$ that reads a user inputted integer and prints that quantity of terms.

Your output will look as follows: