2nd element in Fibonacci sequence Test feedback fibonacci (2) correctly returned 1 Test negative input argument (-100) Test feedback fibonacci (-100) incorrectly returned -100 instead of -1.

I need help editing this code I keep getting an error import java.util.Scanner;public class Factorial {    public static void main(String[] args)    {        Scanner scan=new Scanner(System.in);        System.out.print("Enter a number to find its factorial value : ");        //read an integer value from keboard        int num=Integer.parseInt(scan.nextLine());        //Calling fact method        System.out.printf("Facorial of %d is %d ", num,fact(num));    }        /*Recursive method, fact     * Method name:fact     * Input arguments:n as integer      * Output arguments: an integer value     * */    public static int fact(int n)    {        //Base case :        //Return 1 if n value is either 0 or 1        if(n==0 || n==1)            return 1;        else            //calling method, fact with n-1             return n*fact(n-1);    }//}//

I need help with this java problem described below:  import java.util.Scanner; import java.util.InputMismatchException;   public class ExpirationMonth {    public static void main(String[] args) {       Scanner scnr = new Scanner(System.in);       int expirationMonth;       boolean valueFound = false;              while (!valueFound) {          try {             expirationMonth = scnr.nextInt();             valueFound = true; System.out.println("Expiration month: " + expirationMonth); System.out.println("Processed one valid input value");          }            /* Your code goes here */         }    } }

I need help with this Java Problem as described in the image below: import java.util.Scanner; public class LabProgram {      public static int fibonacci(int n) {      /* Type your code here. */         }      public static void main(String[] args) {      Scanner scnr = new Scanner(System.in);      int startNum;            startNum = scnr.nextInt();      System.out.println("fibonacci(" + startNum + ") is " + fibonacci(startNum));   }}

I need help with this Java problem to output as it's explained in this image below: import java.util.Scanner;import java.util.ArrayList;import java.util.Collections;public class LabProgram {    static public int recursions = 0;    static public int comparisons = 0;    private static ArrayList<Integer> readNums(Scanner scnr) {        int size = scnr.nextInt();                        ArrayList<Integer> nums = new ArrayList<Integer>();        for (int i = 0; i < size; ++i) {                  nums.add(scnr.nextInt());      }      return nums;    }        static public int binarySearch(int target, ArrayList<Integer>   integers, int lower, int upper) {        recursions+=1;        int index = (lower+upper)/2;        comparisons+=1;         if(target == integers.get(index)){            return index;        }         if(lower == upper){            comparisons+=1;             if(target == integers.get(lower)){                return lower;            }            else{…

I need help editing this code I keep getting an error import java.util.Scanner;public class Factorial {    public static void main(String[] args)    {        Scanner scan=new Scanner(System.in);        System.out.print("Enter a number to find its factorial value : ");        //read an integer value from keboard        int num=Integer.parseInt(scan.nextLine());        //Calling fact method        System.out.printf("Facorial of %d is %d ", num,fact(num));    }        /*Recursive method, fact     * Method name:fact     * Input arguments:n as integer      * Output arguments: an integer value     * */    public static int fact(int n)    {        //Base case :        //Return 1 if n value is either 0 or 1        if(n==0 || n==1)            return 1;        else            //calling method, fact with n-1             return n*fact(n-1);    }//}//

I need help with my java compiler program by  Generating intermediate code from the AST, such as three-address code or bytecode   import java.util.*; public class SimpleCalculator { private final String input;private int position;private boolean hasDivByZero = false;private Map<String, String> symbolTable; public SimpleCalculator(String input) {    this.input = input;    this.position = 0;    this.symbolTable = new HashMap<>();} public static void main(String[] args) {    SimpleCalculator calculator = new SimpleCalculator("3 + 5 * (2 - 1)");    int result = calculator.parseExpression();    if (calculator.hasDivByZero) {        System.out.println("Error: division by zero");    } else {        System.out.println("Result: " + result);    }} public int parseExpression() {    int value = parseTerm();    while (true) {        if (consume('+')) {            value += parseTerm();        } else if (consume('-')) {            value -= parseTerm();        } else {…