Write a Java program that reads a positive, non-zero integer as input and checks if the integer is deficient, perfect, or abundant. A positive, non-zero integer, N, is said to be perfect if the sum of its positive proper divisors (i.e., the positive integers, other than N itself, that divide Nexactly) is equal to the number itself. If this sum is less than N, the number is said to be deficient. If the sum is greater than N, the number is said to be abundant. The first few perfect numbers are 6, 28, 496, and 8128. |Illustrations: Number Factors of the number less than itself | Sum of Factors 3. 2, 1 14, 7, 4, 2, 1 6 28 28 For example, the number 6 is perfect, since 6 = 1 + 2 + 3, the number 8 is deficient, since 8>1 + 2+ 4, while the number 12 is abundant, since 12< 1 + 2 + 3 + 4 + 6. Sample Input/Output: Depicted below are sample outputs when the program is executed (the items in bold characters are input from the user, while the items in bold italic are calculated and printed by the program): Input N: 5 Input N: 6 Input N: 18 5 is deficient. 6 is perfect. 18 is abundant.

Write a recursive function in Java that accepts an integer as input and returns 1 + 1/2 + 3 + 1/4 + ...(n or 1/n). The answer is the sum of the odd integers from 1 to n plus the sum of the reciprocals of the even integers.

Exercise 1Write a Java method random that generates and returns a random number between 14 and 59(using SecureRandom). Test your method several times using a main function

Write a Java program that uses two nested for loops and the modulus operator (%) to detect and print all prime numbers from 1 to 10,000. Prime numbers are integral numbers that are only evenly divisible by themselves and one (1). Display all the prime numbers found.