[C_MM107-Easy] Identifying prime numbers Score: 0 / Overturn: 0.8 Problem Description: Input an integer n and check whether n is a prime number. Enter a description: Input an integer n from the keyboard, 10000>n>1, and n is an integer. Output description: If n is a prime number, output n is a prime number. Otherwise output n is not a prime number. example:.