A twin prime is a prime number that differs from another prime number by two. Write a function called isTwinPrime(_:) which takes an integer and returns true
if it is a twin prime, or false
if it is not.
isTwinPrime(5) //5 returns true.
isTwinPrime(9) //9 returns false.
isTwinPrime(7) //7 returns true.
isTwinPrime(23) //23 returns false
*HINT: Use a helper function to first check if a given number is prime.
Here are the overall instructions for code challenges. Before you begin, fork and clone this repo and work through your solution in the included starter playground file. When you're done, Please make sure to save and push all your work, and submit a Pull Request. Don't forget tag your TL so they can review your submission!