4. A prime number is a number that can only be divided either by 1 or by itself. The algorithm: To detect a prime number, we use the modulo operator where "Modulo of Number1% Number2 gives us the remainder of the division" and if the remainder is zero then Number1 is divisible by Number2. If userInput was a variable that contains the nur userinput was a variable that contains the number the user wants to find if it is prime or not, then a code that tests "if there is any Modulo of userInput % Counter that is equal to 0" for counter values that are between 2 and "userInput-1" we can determine whether userInput is a prime number or not. Write a code using either While or For-Each Number Loop (Whichever you are more comfortable with) to detect if the number userlnput is prime or not. The output is displaying either "Is Prime" or "Not Prime" on label. Variables: Event handler: Do 4. A prime number is a number that can only be divided either by 1 or by itself. The algorithm: To detect a prime number, we use the modulo operator where "Modulo of Number1% Number2 gives us the remainder of the division" and if the remainder is zero then Number1 is divisible by Number2. If userInput was a variable that contains the nur userinput was a variable that contains the number the user wants to find if it is prime or not, then a code that tests "if there is any Modulo of userInput % Counter that is equal to 0" for counter values that are between 2 and "userInput-1" we can determine whether userInput is a prime number or not. Write a code using either While or For-Each Number Loop (Whichever you are more comfortable with) to detect if the number userlnput is prime or not. The output is displaying either "Is Prime" or "Not Prime" on label. Variables: Event handler: Do