Write a program that prints all prime numbers in the range [ LB,UB ]. You may assume (that is, there is no requirement to validate) that the pre-condition(2 LB UB) is true. Note Based on https://en.wikipedia.org/wiki/Primality_test on January 15, 2018 The simplest primality test is trial division: Given a number x, check whether any integer i [ 2,x ] evenly divides x (that is, whether the division x/i leaves a remainder of 0). By definition, when x is divisible by any of the i values, x is composite, otherwise x is prime. Pseudocode PROGRAM INPUT "LB? ",LB INPUT "UB? ",UB FOR x := LB TO UB BY 1 IF ( IsPrime(x) ) THEN PRINT x,ENDL END END STOP END //--------------------------------------------------------------- FUNCTION IsPrime(IN x: int) RETURNS boolean //--------------------------------------------------------------- r: boolean r := ___ FOR i := 2 TO SquareRootOf(x) BY 1 r := r AND (x MOD i ___ 0) // *Note* (x MOD i = 0) iff i evenly divides x! END RETURN( r ) END.