3. A prime number is a number that can be divisible by 1 and itself only. Write a pseudo code of an algorithm to determine if an integer x is a prime number or not. Hints: (1) We can use a loop to check for each integer i smaller than x whether x is divisible by i. (2) If we want to make it quicker, we can stop earlier, the question is when should we stop the loop.