The code outputs a Fibonacci sequence of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55. The next number is found by adding the two numbers before it together – this can be expressed as: Fn = Fn–1) + Fn–2 where F0 = 0 and F1 = 1.

Write a similar algorithm using recursion that only returns the final result – e. g., Fibonacci(10) = 55. Annotate your pseudocode to show parameter passing and a terminating condition. [6]

Create a class named majors that includes an enumeration for the six majors offered by a college as follows: acc, chem, cis, eng, his, phys. display the enumeration values for the user, then prompt the user to enter a major. display the college division in which the major falls. acc and cis are in the business division, chem and phys are in the science division, and eng and his are in the humanities division. save the file as majors.java.