The procedure prime returns a value of "PRIME" if number is prime (divisible by only 1 and itself) and returns "NOT PRIME" otherwise.PROCEDURE prime (number){divisor ← number count ← 0 REPEAT number TIMES { IF (number MOD divisor = 0) { count ← count + 1 } divisor ← divisor - 1 } IF (<MISSING CODE>) { RETURN ("PRIME") } ELSE { RETURN ("NOT PRIME") }}Assuming number must be larger than 1, what must go in the <MISSING CODE> section to make this procedure work as expected?

Then try StudyFetch, the AI-powered platform that can answer your questions and teach you more about it!