Answer:
Office365 with PowerPoint Online comment accessibility.
First of all, we will need a function that checks if a number is prime or not:
boolean isPrime(int n){
for(int i=2; i<=math.sqrt(n); i++){
if(n % i == 0) return false;
}
return true;
}
Then, in the main program, we will call this function with all the desired inputs, and we will print the prime numbers:
for(int n=100; n<= 1000; n++){
if(isPrime(n)) print(n);
}
Answer and Explanation:
I believe its A. Modularity enables multiple programmers to work on a program at the same time..
Let me know if I'm wrong..
Answer:
I think Uk was the strongest ally in us
Explanation:
I actually have no idea but I guess that's it? (Sorry I don't live in that country so we don't really learn those things)
