I need help with writing this in java code. read the instructions please. Thank you!

LAB2 PART 2 REQUIREMENT Recursion is a programming term that means calling a Method from itself. Recursive Method is a Method that calls itself during its execution. Each time the Method is called back will apply on the same problem, but the problem is reduced smaller. Using Java provides an application that has two classes. One class, SP2021_Recursionin Static Method_yourLastName class, stores all the static methods using the recursion to calculate the results of the problems in the below table. Problem Description n! an Sum (n) Factorial of an integer n where n provided from the keyboard a powern, where a and n are int numbers provided from the keyboard Sum (n) = 1 + 2 + 3 + + n where n is an int provided from the keyboard Sum (m, n) = m + (m+1), (m+2) + - + n where m and n are int numbers provided from the keyboard Fibonacci sequence Fn = Fr - 1 + Fn-2: Fo = 0 and Fn 1 The greatest common divisor (GCD) of two integers m and n; Sum n) FR m GCD (n,m) >n where m, n is provided from the keyboard One other class, SP2021_Practice Access Static Methods yourLastName is the driver class that has the menu of all the problems in the above table to allow users to select the problem to work on: SP2021_PracticeAccessStaticMethtods_Martinez.java STATIC RECURSION METHODS MENU - LUIS MARTINEZ 1. n! (Factorial of an integer n) 2. a" (a power n) 3. Sum (n) = 1 + 2 + 3 + .. + n 4. Sum (m, n) = m + (m+1), (m+2) + - + n 5. Fibonacci sequence in 6. GCD (The greatest common divisor of m and n) 0. Exit At each selected problem, the program should display the message to ask and read all the necessary information then access the static method from the class SP2021_Recursion Static Method_yourLastName to display the result as one of the outputs below: At each selected problem, the program should display the message to ask and read all the necessary information then access the static method from the class SP2021_Recursion Static Method_yourLastName to display the result as one of the outputs below: reads some necessary information entered from the keyboard then display the result of the following problems. After finishing one problem, the menu should be re-displayed to allow users to select other problem to work on The output of each problem is one line of the following: SP2021_PracticeAccessStaticMethtods_Martinez.java STATIC RECURSION METHODS - LUIS MARTINEZ 1. Factorial of n = 5 is 120 2. SP2021_PracticeAccessStaticMethtods_Martinez.java STATIC RECURSION METHODS - LUIS MARTINEZ 2 to the power 3 is 8 3. SP2021_PracticeAccessStaticMethtods_Martinez.java STATIC RECURSION METHODS - LUIS MARTINEZ Sum from 1 to 10 is: 55 4. SP2021_PracticeAccessStaticMethtods_Martinez.java STATIC RECURSION METHODS - LUIS MARTINEZ Sum from 5 to 7 is 18 4. SP2021_PracticeAccessStaticMethtods_Martinez.java STATIC RECURSION METHODS - LUIS MARTINEZ Sum from 5 to 7 is 18 5. SP2021_PracticeAccessStaticMethtods_Martinez.java STATIC RECURSION METHODS - LUIS MARTINEZ The Fibonacci at 10 is 55 6. SP2021_PracticeAccessStaticMethtods_Martinez.java STATIC RECURSION METHODS - LUIS MARTINEZ Greatest Common Divisor (CCD) of 120 and 90 is 30