Write a program to test for primality of any number n (that is, to test if n is a prime number). start by writing an algorithm (a set of precise mathematical steps that can be written into a program) to test for primality. for full credit, run the program and use it to test for primality on several numbers. see what the largest number your program can handle is before you find it too slow to yield a result in a reasonable time (if it takes longer than 10 minutes to execute, you are done). use your own imagination. remember that if the number n is even, it cannot be a prime number. you can write your program to simply try if it is a multiple of any numbers smaller than n. also you can design your program to store all prime numbers less than n that your program has found, then take advantage of the fact that a number only needs to be tested to see if it is a multiple of those prime numbers smaller than n/2. if it is not, then it must be a prime number itself.