Comupter assignment

 Assignment 1A tests your knowledge of Recursion (Chapter 18. Design a program/project/driver class (the program/project/driver class file should be called YourNameAssignment1A;  replace YourName with your actual name), with the following exact1 methods in this order:  Method Description Method1 A recursive method that computes the Nth element in this series:  Method1(x, N)=1+x 1+x2+x3+…+xN where N is an integral number between 0 and 1000 and x is a floating-point number. The method  should return N+1 if x is 1. For example, Method1(1,0) is 1, Method1(1,1) is 2, Method1(1,2) is 3,  Method1(2,1) is 3 Method1(2,2) is 7. The method should receive the floating-point number x and integral number N as parameters and  return the Nth value in the series for that x and N.  Method2 A recursive method that finds the number of occurrences of a specific letter in a word (any case). The  method should receive the character for the Letter and the string with the Word as parameter and  return the number of occurrences of the Letter in Word. For example, Method2(‘a’, “cat”) is 1,  Method2(‘a’, “Azalea”) is 3, Method2(‘a’, “CALAMATA”) is 4, Method2(‘a’, “biotechnologies”) is 0.  main The main method should call the 2 methods as follows: ▪ Ask the user for a floating-point number X and print the first 21 values from the Method1 series  (call Method1 for X and all the Numbers between 0 and 20) and output them in a table format,  with first column showing the value for the Number and the second column showing the  corresponding value computed from Method1(X, Number) call. For example, if the user enters 2 for the floating-point number X, the output should be: N METHOD1(2, N) 0 1 1 3 2 7 … (and so on until 20) ▪ Ask the user for Word, and use Method2 to compute the number of occurrences of each Letter in the alphabet (from ‘a’ to ‘z’) in the Word (counting both lower and upper case of the Letter)  and output it in a table format with first column showing the letter and the second column  showing the corresponding number of occurrences computed from the Method2(Letter, Word) call). For example, if the user enters “cat” for the Word, the output should be: Letter METHOD2(Letter, ”cat”) A 1 B 0 C 1 … (and so on until Z)