Good start, now first implement isPrime function first, and test it out
with a loop from 0 to 100.
Remember a prime number can only be a prime if it is only EVENLY divisible
by itself and 1. That means if the mod operator return testPrime %
index== 0 is true and the index is > 2 and not equal to testPrime
then its not a prime.