The Fibonacci sequence is the series of numbers $0,1,1,2,3,5,8,....$ Formally, it can be expressed in the form:

fib$0=0$

fib $1=1$

fib$0=$ fib$($n$-1)+$ fib $($n$-2)$

Write a multithreaded program that generates the Fibonacci sequence using either the Java thread library. This program should work as follows: The user will enter at the command line the number of Fibonacci numbers that the program should generate. The program will then create a separate thread that will generate the Fibonacci numbers and place the sequence in a memory space shared by the threads $($an array is probably the most convenient data structure$).$ When the child thread is finished, the parent thread will display the sequence generated by the child thread. Since the parent thread cannot start displaying the Fibonacci sequence until the child thread has completed, the parent thread must wait until the child thread has completed.