Fix the Java program: Make sure the program have the "Main" function. Code: class RemoveDuplicates { publicstaticvoid Main(String[] args) { int a[]={1,3,5,2,3,5,3,3,5,7,9,3}; System.out.print("Before Sorting:"); for (int i=0;ia[j]) { int temp=a[i]; a[i]=a[j]; a[j]=temp; } } } //After sorting for(int i=0;i

1  public static int sum(int x, int y){   2     int z = x +y;   3     return z;   4 }      5 public static void main(String[] args){    6    …    7      sum(a+2, b);    8  …    9 }      write the signature of the method sum: sum(int,int) *Method name/parameter list   list local variables of sum: x, y, and y are local variables of the function.    list the parameters of sum: int x, int y   write the line number where a call to sum occurs 7    list the arguments for the above call   list the return type of sum here ______________

1. Divisors: In a class Divisors.java, read in a maximum integer n and use nested loops to print a list of divisors for each of 1 through n as shown in the following transcript. Sample transcript (input underlined): Largest integer? 100 1: 1 2: 1 2 3: 1 3 4: 1 2 4 95: 1 5 19 95 96: 1 2 3 4 6 8 12 16 24 32 48 96 97: 1 97 98: 1 2 7 14 49 98 99: 1 3 9 11 33 99 100: 1 2 4 5 10 20 25 50 100

Question #4: Re-write the program of Question #3 using data files. The input data numbers.txt contains (positive) integer numbers. Each time the program reads a number, check whether it is a prime and stores the result in the output file Results.txt. 373 373 is Prime!! 11 11 is Prime!! 2552 is NOT prime!! 5 is Prime!! 3561 is NOT prime!! 2552 3561 numbers.txt Results.txt