Let us define a sample Fibonacci Sequence of $10$ numbers: $1,1,2,3,5,8,13,21,34,55.$ Fibonacci sequences are very

useful not just in maths but in every facet of life. The sample provided is for a sequence of first $10$ numbers, but this

can be extended to any sequence of numbers until infinity.

Each number in the sequence is derived using the formula F$($k$)=$ F$($K$-1)+$ F$($K$-2)($k is the index starting from $2)$

except the first $2$ numbers. The value of F$(0)=$ F$(1)=1.$ These $2$ values are hard coded. The formula works starting

with index $2.$ In simple terms, the current number is the sum of previous $2$ numbers of the sequence.

Note: Fibonacci sequence for negative numbers are not defined.

Write a Java program to code a Fibonacci method $($Fib$($int n$)).$ So$,$ Fib$(3)$ will display $1,1,2$ and Fib$(6)$ will display

$1,1,2,3,5,8.$ The input to the Fib function is the number of elements to be displayed for a Fibonacci sequence.