[Solved]Java Given Integer N 1 Smallest Integer D 1 Divides N Prime Factor Find Prime Factorizatio Q37257754

In Java:

For a given integer   n > 1, the smallest integer d> 1 that divides n is a prime factor. We can find the primefactorization of n if we find d and then replace n by the quotientof n divided by d, repeating this until n becomes 1. Write a javaprogram that uses a stack to print the prime factors of a positiveinteger in descending order. For example, for n = 3960, yourprogram should produce
      11 * 5 * 3 * 3 * 2 * 2 * 2

Show the ArrayStackADT interface

Create the ArrayStackDataStrucClass<T> with the followingmethods: default constructor, overloaded constructor, copyconstructor, initializeStack, isEmptyStack, isFullStack, push,peek, void pop

Create the PrimeFactorizationDemoClass: instantiate anArrayStackDataStrucClass<Integer> object with 50 elements.Use a try-catch block in the main( ) using pushes/pops.

Exception classes: StackException, StackUnderflowException,StackOverflowException

Show the 4 outputs for the following: 3,960 1,234  222,222    13,780

Expert Answer

---

Answer to In Java: For a given integer n > 1, the smallest integer d > 1 that divides n is a prime factor. We can find the prime f… . . .