Getting an error while running my code.   import java.util.Scanner; import java.math.BigInteger; public class Main{ Bigintege result; public static void computeFact(int n){ BigInteger result = BigInteger.ONE; while (n>0){ result = result.multiply(BigInteger.valueOf(n)); n = n-1; } } public static void computeFact2(int n){ BigInteger a = 4n; BigInteger fact = 1; while(n>0) { fact = fact.multiply(BigInteger.valueOf(4n)); a = a - 1; } } BigInteger b=396, c, d; public static void compute(int n) { BigInteger sum = 0, final_result; public static void computeSummation() { while(n > 0) { sum = sum + (a/result) * (c); n = n-1; } final_result = d * sum; System.out.println("Final result is "+final_result); } public static void main(String[] args) { Scanner kybd = new Scanner(System.in); while ( true) { System.out.print("\n\tEnter an Integer Number e.g. 5 "); int num = kybd.nextInt(); computeFact(num); computeFact2(num); compute(num); computeSummation(num); } } }

public class ArraySection {     static void arraySection(int a[], int b[]) {        int k =  0;        int [] c = new int[a.length];        for(int i = 0; i < a.length; i++) {            for(int j = 0; j < b.length; j++)                if(a[i] == b[j])                    c[k++] = a[i];                                        }        for(int i = 0; i < k; i++)            System.out.println(c[i]);            System.out.println();    }    public static void main(String[] args) {         int a[] = { 1, 2, 3, 4, 5 };        int b[] = { 0, 2, 4,5 };                        arraySection(a,b);        }}   Calculate the algorithm step number and algorithm time complexity of the above program?

import java.util.Scanner; public class Inventory {   public static void main (String[] args) {      Scanner scnr = new Scanner(System.in);             InventoryNode headNode;                                                    InventoryNode currNode;      InventoryNode lastNode;       String item;      int numberOfItems;      int i;       // Front of nodes list                                                                               headNode = new InventoryNode();      lastNode = headNode;       int input = scnr.nextInt();       for(i = 0; i < input; i++ ) {         item = scnr.next();         numberOfItems = scnr.nextInt();         currNode = new InventoryNode(item, numberOfItems);         currNode.insertAtFront(headNode, currNode);         lastNode = currNode;      }       // Print linked list                                                                         currNode = headNode.getNext();      while (currNode != null) {         currNode.printNodeData();         currNode…

import java.util.Scanner; public class LabProgram {   /* Define your method here */      public static void main(String[] args) {      Scanner scnr = new Scanner(System.in);       /* Type your code here. */   }}