Create an IPO Design$/$Algorithm describing the steps you would follow to determine if a given number $($an integer$)$ is a prime number or not. Recall that an integer is prime if it is ONLY evenly divisible by $1$ and the number itself. For instance, $13$ is prime because it is only evenly divisible by $1$ and $13.$ On the other hand, $24$ is not prime because it is evenly divisible by $1,2,3,4,6,8,12,$ and $24.$ It will help you to think back to elementary school division and remainders to solve this problem.

I have included an $.$exe of the program that would be based on an algorithm$/$a design so you can run it and think about the steps that are involved in the design of the program. This is NOT a one$-$line answer like $$just determine if it is a prime number$$ think of how you might tell someone else what steps are involved. In your mind you may be able to see a number like $13$ and know if it is prime or not, but your brain is actually taking steps that you probably don$$t even realize $-$ a computer needs to be told each step, and by writing a step by step algorithm in English now, it will eventually help us to$,$ later in the course, write code to tell the computer what to do$.$