Python please  prime_test.py: def is_prime(num): #ADD CODE to return True if num is prime; False if not def main(): #ADD CODE to call is_prime() for integers 1-100 # and print the ones that are prime main()

class Main {             // this function will return the number elements in the given range             public static int getCountInRange(int[] array, int lower, int upper)             {                         int count = 0; // to count the numbers                         // this loop will count the numbers in the range                         for (int i = 0; i < array.length; i++)                         {                     // if element is in the range                                     if (array[i] >= lower && array[i] <= upper)                                                 count++;                         }                                                 return count;             }               public static void main(String[] args)             {         // array         int array[] = {1,2,3,4,5,6,7,8,9,0};                         // ower and upper range                         int lower = 1, upper = 9;                         // throwing an exception…

python def factorial(n):pass # replace this line with your lines of recursive codedef sum_recursively(n):pass # replace this line with your lines of recursive codedef sumlist_recursively(l):pass # replace this line with your lines of recursive codedef reverse_recursively(l):pass # replace this line with your lines of recursive code#EXTRA CREDITdef multiply_recursively(n, m):pass # replace this line with your lines of recursive code

Lab Goal : This lab was designed to teach you more about recursion. Lab Description : Take a number and recursively determine how many of its digits are even. Return the count of the even digits in each number. % might prove useful to take the number apart digit by digit Sample Data : 453211145322224532714246813579 Sample Output : 23540