pictures in opposite order

Tell the user whether the entered number is prime or not Ask the user whether he/she would like to enter another number to test If the user responds in the affirmative (types a y or a Y, your program must be able to handle both), start again - - NOTE: The starter code in your Vocareum account contains five cout statements. You MUST use these five cout statements exactly as they are given. Do NOT modify these statements. Write the rest of the code and insert these five cout statements into your code in the appropriate locations. Do NOT add additional cout statements. The following is an example of correct execution of the program Enter an integer greater than 1 to check if it is a prime number: 3 The number 3 is a prime number. Do you want to enter another number? (y or n): y Enter an integer greater than 1 to check if it is a prime number: 4 The number 4 is NOT a prime number. Do you want to enter another number? (y or n): n Exiting program .. Algorithm Hints It is highly recommended that you first design your program with a flowchart. To implement this algorithm use a do-while loop to control the algorithm repetition if the user wants to enter another number to test use a for loop inside the do-while loop to step through the required divisors use an if structure inside the for loop to check if the remainder of the division is zero or not (remember the % operator) the statements in the if structure should include the setting of a flag to indicate whether the division remainder was zero or not, and a break statement to break out of the for loop if the remainder is zero (in that case it has been established that the number is prime, so there is no need to carry on with divisions). The flag status can be used to print out whether the number is prime or not