12. 13 points] A number n is prime if it has no proper divisors. A positive integer d is a proper divisor of n if d is less than n and n % d is zero. Thus, to find proper divisors of a nu d between 2 and n/2. Write a C++ program that asks the user for a positive integer n, determine if number n is prime by displaying a message "Prime" or "Not Prime" mber n, we must try all values of