This is a function that takes in a positive integer n, and returns True if the integer is a prime number, or False if it is not. def prime(n):
for i in range(2, n):
if n % i == 0:
return False
return True
Write a function all_primes(vals) that takes in a list of integers vals and returns the boolean value True if ALL of elements in the list are prime, or False otherwise.

For example, all_primes([3, 7, 2]) would return True (since all three of those numbers are prime), but all_primes([7, 11, 12, 17]) would return False (since 12 is not prime, even though the other three are).

You are required to call the prime function at least once within all_primes. You can assume that vals contains at least one element.