PYTHON

1. Write the definition of a function max that has three intparameters and returns the largest.

2. Write a function min that has two str parameters and returnsthe smallest. (Smallest in the sense of coming firstalphabetically, not in the sense of "shortest".)

3. Define a function is_prime that receives an integer argumentand returns true if the argument is a prime number and otherwisereturns false. (An integer is prime if it is greater than 1 andcannot be divided evenly [with no remainder] other than by itselfand one. For example, 15 is not prime because it can be divided by3 or 5 with no remainder. 13 is prime because only 1 and 13 divideit with no remainder.) This function may be written with a forloop, a while loop or using recursion.

4. Assume the availability of a function is_prime. Assume avariable n has been associated with positive integer. Write thestatements needed to compute the sum of the first n prime numbers.The sum should be associated with the variable total.

5. Assume the availability of a function is_prime. Assume avariable n has been associated with positive integer. Write thestatements needed to find out how many prime numbers (starting with2 and going in increasing order with successively higher primes[2,3,5,7,11,13,...]) can be added before exceeding n. Associatethis number with the variable k.