A prime number is a number that is only evenly divisible by one and itself. For instance, 2, 3, 5, 7, and 11 are the first 5 prime numbers. An easy (although not very efficient) way of finding out if a number is prime is to perform trial division. If you want to know if a number, n, is prime, divide n by every number from 2 up to the squareroot of n and see if any have a remainder of zero. If any number evenly divides n (has no remainder), you know that n is not prime. Write a function named next_largest_prime which has one parameter. Your function will find and return the next largest prime number greater than or equal to the input number. > > > next_largest_prime (6) 7 > > > next_largest_prime(8) 11 > > > next_largest_prime (101) 101 > > > next_largest_prime(12345) 12347 > > > next_largest_prime (8675309) 8675309