"Write a function named isPrime( num ) that accepts a single argument (num) and returns True if the argument is prime, and False otherwise.
Example: isPrime(2) should return True. isPrime(5) should return True as well. isPrime(4) should return False. You may assume that the input num will be a non-negative integer. (0, 1, 2, etc...) Next, write a second function named nextPrime( num ) that will return the next prime number following the corresponding number that is the argument. It is likely that your nextPrime( num) function can make use of the isPrime( num ) function to make it's job easy! For example: nextPrime(5) should return (NOT PRINT) the integer 7, and nextPrime(100) should return the integer 101. You may assume that only non-negative integers will be used as input