java course use java import and comments to explain the codethanks DONT USE PACKAGE PACKAGE L4.num1;For a given integer n >1, the smallest integer d 1 that divides n is a prime factor. We can find the prime factorization of n if we find d and then replace n by the quotient of n divided by d, repeating this until n becomes 1. Write a java program that uses a stack to
OR
OR