Given an integer, determine if the integer is a prime number. A prime number is a number which has exactly two distinct natural numbers divisors: 1 and itself. Use the following pseudo code. Pseudo code: 7. a) Read the integer, n b) Check if the number is an even number (divisible by 2). c) If the number is even and 2, then conclude it is not a prime number. d) If the number is not even, continue. e) Start a "for" loop from 3 to n. f) Verify if the number is divisible by each number between 3 and n (use Mod function) g) factors = factors+1 . if it is divisible. h) If factors 0, then it is a prime number