Sequence Efficiency Java

Download:	http://solutionzip.com/downloads/sequence-efficiency-java/
The third programming project involves writing a program to calculate the terms of the following sequence of numbers: 0 1 2 5 12 29 … where each term of the sequence is twice the previous term plus the second previous term. The 0th term of the sequence is 0. The interface to the program should be a GUI that looks similar to the following:
The pair of radio buttons allows the user to choose whether an iterative or recursive method is used to compute the term of the sequence. When the user enters a value for n and then clicks the Compute button, the nth term of the sequence should be displayed in the Result field. The Efficiency field should contain the number of calls to the recursive method when the recursive option is chosen and the number of iterations of the loop when the iterative option is selected.
The Iterative radio button should be initially set to selected.
You should run your program with values for n from 0 to 10 and record and graph the value of the Efficiency field for both the iterative and recursive options. The graph should be contained in a Word document that also contains a brief explanation of the observed results. That document must also be submitted with the code for this project.

Download:	http://solutionzip.com/downloads/sequence-efficiency-java/