A positive integer value is a prime number if it is divisible only by 1 and by itself. Write a C++ code segment to read a positive integer value greater than 2 and to output a message indicating whether it is a prime number or not. To find out whether a positive integer value n greater than 2 is a prime number, you may repeatedly divide it by i= 2, then 3, then 4, . . . , until the remainder is 0 or i*i>=n. The given value is a prime number if the remainder is not 0; otherwise, it is not a prime number.