Question

Problem 2: (8 pts) The Fibonacci sequence is the series of numbers 0, 1, 1, 2, 3, 5, 8.,.. Formally, it can be expressed as: fib0-0 fibl-1 fibn-fibn-1+fibn-2 Write a multithreaded program that generates the Fibonacci sequence. This program should work as follows: On the command line, the user will enter the number of Fibonacci numbers that the program is to generate. The program will then create a separate thread that will generate the Fibonacci numbers, placing the sequence in data that can be shared by the threads (an array is probably the most convenient data structure). When the thread finishes execution, the parent thread will output the sequence generated by the child thread. Because the parent thread cannot begin outputting the Fibonacci sequence until the child thread finishes, the parent thread will have to wait for the child thread to finish. This problem requires the parent thread to wait for the child thread to finish its execution before printing out the computed values. If we let the parent thread access the Fibonacci numbers as soon as they have been computed by the child thread-rather than waiting for the child thread to terminate-what changes would be necessary to the solution for this exercise? Implement your modified solution Solution:

Answer 1

mpot ava u.concuorent éecultfon ExcepHon public class f9bonacc ↑ ryPuat e statrc Jong门values Public static uoid main t sting anqseptde -ception int n catch Cescceptlon e) awa numb es) tong StartSstem nanoftmec) ong end Spstem.manolimtc system, nano'lǐmec);

slant- System nanoltme e ads, to Gxecuution endSygtem manormer value i5 ietunm vaue in)

pubic Stotrc dong Sequunce Cant n) etse aivate static class Rbonacctthntad mptements Runnabl e this andend Public vo unc) catch (Cxception e)

vetuan else