How do i fix this code below.   Write a program that prints all digits of any integer in reverse order.   import java.util.Scanner; public class ReverseDigits {    public static void main(String[] args)    {       Scanner in = new Scanner(System.in);       int n = in.nextInt();       // TODO: Print the digits of n in reverse         int flag=0; int sum=0;   if(n<0) { System.out.print("-"); n=-1*n; } else if(n==0) { flag=1; }   while(n!=0) { int r=n%10; if(r==0&&sum==0) { System.out.print(r); } sum=sum*10+r; n=n/10; }       System.out.print(sum);       System.out.print("-");         System.out.println();    } }

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

Complete the method definition to return the hours given minutes. Output for sample program:3.5 -java code- import java.util.Scanner;public class HourToMinConv {   public static double getMinutesAsHours(double origMinutes) {        /* Your solution goes here */    }    public static void main (String [] args) {      Scanner scnr = new Scanner(System.in);      double minutes;       minutes = scnr.nextDouble();       // Will be run with 210.0, 3600.0, and 0.0.      System.out.println(getMinutesAsHours(minutes));   }}

How do I code: public static int sum(int[] arr) public static int sum(int[] arr, int firstIndex, int lastIndex) public static double average(int[] arr) in java?

this needs to be corrected  The file provided in the code editor to the right contains syntax and/or logic errors. In each case, determine and fix the problem, remove all syntax and coding errors. java  import java.util.Scanner; public class DebugThree3 {    public static void main(String args[])    {       String name;       name = getName()       displayGreeting(namme);               }    public static String getName(void)    {       String name;       Scanner input = new Scanner(System.in);       System.in.print("Enter name ");       name = input.nexlLine();       return namer;    }    public static displayGreeting(String name)    {       System.outprintln("Hello, " + name + "!");    } }

1. When you run the following code, what would happen?public class Question1 {public static void main(String arg[]){int i;int [] A = new int[10];int count = 0;int temp = 10;for (i=0; i < A.length; i++)if (A[i] < temp) count++;System.out.println(count);}}(a) It finds the smallest value and stores it in temp.(b) It finds the largest value and stores it in temp.(c) It counts the number of elements equal to the smallest value in list.(d) It counts the number of elements in list that are less than temp.

Java Questions - (Has 2 Parts). Based on each code, which answer out of the choices "A, B, C, D, E" is correct. Each question has one correct answer. Thank you. Part 1 - Given the following code, the output is __. class Sample{  public static void main (String[] args){  try{  System.out.println(5/0);}catch(ArithmeticException e){  System.out.print("Divide by zero????");}finally{  System.out.println("5/0");  } }} A. Divide by zero????B. 5/0C. Divide by zero????5/0D. 5/0Divide by zero????E. "5/0" Part 2 - Given the following code, the output is __. try{  Integer number = new Integer("1");   System.out.println("An Integer instance.");}catch (Exception e){  System.out.println("An Exception.");} A. An Integer instance.B. An Exception.C. 1D. Error: ExceptionE. None of the options

def hailstone(n):  h.append(int(n))  if n == 1:    return h  while n != 1:    if n % 2 == 0:      return hailstone(int(n/2))    else:      return hailstone(int(3*n + 1))y=int(input("N: "))if y <= 0:    print("N must be positive!")else:    print("Hailstone sequences for 1 to " + str(y) + ":")    m=0;    i=1    for x in range(1, y+1):         n = i        h = []        h = hailstone(n)        print(h)         s=len(h)        if s > m:            m=s            flag=n        i=i+1    print("First longest sequence found in n =", + flag )     If i don't one the output have the square braket? How can I fix this code? Can you pleasw help me?

public static int test(int n, int k) { if (k == 0 || k == n) { return 1; } else if (k>n) { return 0; } else { return test(n-1, k-1) + test(n-1, k); } ww For each of the following calls, indicate the output that is produ test(7,5); test(6,4); test(4,5); test(8,3); test(5,5);

JAVA Language:  Transpose Rotate.  Question:  Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string)         import java.util.*;            public class TestTranspose {        public static void main(String[] args) {          String plain = "this is the secret message";   // Here's the message           Transpose transpose = new Transpose();          String secret = transpose.encrypt(plain);          System.out.println("\n ********* Transpose Cipher Encryption *********");          System.out.println("PlainText: " + plain);    // Display the results          System.out.println("Encrypted: " + secret);          System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt        }      }            abstract class Cipher {        public String encrypt(String s) {          StringBuffer result = new…