Can you please answer it a bit fast and don't copy paste from any other source thank you so much in advance.

return; } Question No.4: Write a Java program to print only the prime numbers of Armstrong numbers from 0- 10000. Hint: you can use nested for loop with functions. (8 Marks) An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. For example, 371 is an Armstrong number since 3**3 +7**3+1**3 = 371. A Prime Number is: Prime numbers are special numbers that can only be divided by themselves and 1. A positive integer is called an Armstrong number of order n) if a whole number that cannot be made by multiplying other whole numbers (if we can make it by multiplying other whole numbers it is a Composite Number) abcd... = an + bp + cp + dp + And 1 is not prime and also not composite. Here we see it in action: In the case of an Armstrong number of 3 digits, the sum of cubes of each digit is equal to the number itself. For example, 153 is an Armstrong number because 153 = 1*1*1 + 5*5*5 +38383 Prime: 2 3 5 7 etc... #include