Create a static listDiv() method that gets all the divisors of a given integer on new list called Ldiv. Create another listDivPrim() method that gets all the prime divisors of a given integer.

Create a Python function that takes a list of integers as input andreturns a new list containing only the prime numbers from the input list.Provide a clear explanation of your implementation and include a test case.

Write a Java program that takes a positive integer as input and performs prime factorization using a while loop. The program should display the prime factors of the given number.Ensure the program handles invalid input gracefully, providing appropriate messages

Define a class, and in the main() method of the class ask the user for an integer input. Based on the input, the method must print out all the prime numbers less than that number.Note: a prime number is one which is only divisible by 1 and itself.

Write the codeWrite a Java Program that prints out all prime numbers within a given integerSample Test CasesTest Case 1:Expected Output:Enter·an·integer:·5Prime·numbers·within·5:2·3·5·Test Case 2:Expected Output:Enter·an·integer:·30Prime·numbers·within·30:2·3·5·7·11·13·17·19·23·29·

A prime number is an integer greater or equal to 2 that is only divisible by 1 and by itself. The first few primes are: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 …N is a prime if and only if it is not divisible evenly by any of the numbers from 2 to N−1. Let’s implement this decision as a function.In the same program numbers.cpp, add a functionbool isPrime(int n);The function should return true if n is a prime, otherwise return false. Change the main function to test your new code.