Write a function called next_prime that takes a scalar positive integer input n. Use a while-loop to find and r use the built-in isprime function. Here are some example runs: >> next_prime(2) ans = >> next_prime(8) ans = 11 >> next_prime(12345678)

-Python- Write a function get_letter_grade, such that when given * a lab grade score and * a list of the grade cutoffsreturns the letter grade of that score.Note: Your function automatically returns A for the values that are >= to the first cutoff-value in the list, then A- for the second cutoff-value, B+ for the third and so on. The function returns None for anything that's below the score for B-. You test that get_letter_grade(97, [93, 90, 87, 83, 80]) correctly returns an A, and get_letter_grade(93, [97, 90, 87, 83, 80]) returns A-. DO NOT hard-code the cutoffs, since they can change! You can copy/paste the following template: def get_letter_grade(score, cutoffs):    if score ... :        return 'A'    ...:        return 'A-'    ...:        return 'B+'    ...:        return 'B'    ...:        return 'B-'

Exercise 5   The greatest common divisor (GCD) of a and b is the largest number that divides both of them with no remainder. One way to find the GCD of two numbers is based on the observation that if r is the remainder when a is divided by b, then gcd(a, b) = gcd(b, r). As a base case, we can use gcd(a, 0) = a. Write a function called gcd that takes parameters a and b and returns their greatest common divisor.

Use Python Write a function, say_spam(n); it takes an integer parameter n and prints "Spam!" n times in response. You should assume n > 0 for this function. Hint: Use a simple for loop with a print statement in the body of the loop.   For example: Test Input Result say_spam(1)   Spam! say_spam(2) say_hello(3) Spam! Spam! say_spam(5)   Spam! Spam! Spam! Spam! Spam!