I'm confused about reverse of prime factorials

Question-3: (Displaying the prime factors) Write a program that prompts the user to enter a positive integer and displays all its smallest factors in decreasing order. For example, if the integer is 120, the smallest factors are displayed as 5, 3, 2, 2, 2. Use the StackOfIntegers class to store the factors (e.g. 2, 2, 2, 3, 5) and retrieve and display them in reverse order Question-4: (The Queue class) Section 10.6 gives a class for Stack. Design a class named Queue for storing integers. Like a stack, a queue holds elements. In a stack, the u homework3java DHomework2java DHomework1 java Homeworkjava 4 b5 import java.io.File; 6 class primeFactorial ( 7 8 //Scanner kb- new Scanner(System.in); public static void primeFactorial(int n)f 9 while(n%2--0) ( System.out.print (2+ ",) n/-2; 10 12 13 for (int i3,icMath.sqrt(n); +2){ 14 15 16 17 18 19 20 21 22 class reverseFactorial 23 24 25 26 public static void main(String[] args) 27 28 29 30 while(ni--0) ( System.out.print (i ", "; if(n>2) System.out.print(n); // TODO Auto-generated method stub int n e; int] arr -new int n]; Scanner kb- new Scanner (System.in); Arrays.sort (arr); Arrays.sort (arr, Collections.reverseOrder)); System.out.println( Enter any positive integer: "): 32 35 36 37 38 39 n-kb.nextIntO; // intI] arr -new intIn]; System.out.println); System.out.print("There are prime factorials "): primeFactorial (n) l Problems Javadod Declaration Console 3 primefactorial Java Application] CAProgram FilesJavalire 1.8.0.191\binjavaw.exe (