The procedure prime returns a value of "PRIME" if number is prime(divisible by only 1 and itself) and returns "NOT PRIME" otherwise. Assuming number must be larget than 1, what must go in the section to make this procedure work as expected?

PROCEDURE prime (number) { divisor = number count = 0 REPEAT number TIMES { IF (number MOD divisor = 0) { count = count + 1 } divisor = divisor - 1 } IF ( { RETURN ("PRIME") } ELSE { RETURN ("NOT PRIME") } }

Assuming number must be larger than 1, what must go in the section to make this procedure work as expected?

1. number = 2 2. count = 2 3. divisor<2 4. count>2