Sample Expected Output of Task 1: Lab3_task1 [Java Application] /Library/Java/JavaVirtualMachines/jdk-13.0.1.jdk/Contents/Home/bin/java (Jun 12, 2020, 9:25:26 PM) 45 345 2345 12345

PrimeAA.java Write a program that will tell a user if their number is prime or not. Your code will need to run in a loop (possibly many loops) so that the user can continue to check numbers. A prime is a number that is only divisible by itself and the number 1. This means your code should loop through each value between 1 and the number entered to see if it’s a divisor. If you only check for a small handful of numbers (such as 2, 3, and 5), you will lose most of the credit for this project. Include a try/catch to catch input mismatches and include a custom exception to catch negative values. If the user enters 0, the program should end. Not only will you tell the user if their number is prime or not, you must also print the divisors to the screen (if they exist) on the same line as shown below AND give a count of how many divisors there are. See examples below. Your program should run the test case exactly as it appears below, and should work on any other case in general. Output…

4. In IntelliJ: By using java code a) Turn the For loop into a loop that adds the numbers from 50 to 1 and execute it. b) Turn the While loop into a loop that adds the numbers from 1 to 50, but does not add the number 25, and execute it. c) Turn the Do-while loop into a loop that add all numbers from 50 to 1, but does not add neither number 25, 27 and 37, excute it

Two bugs are positioned a given distance apart. The first bug moves halfway towards the other. The second bug moves halfway to the first. The first bug again moves halfway to the second. Compute and print the positions of the bugs. The initial position will change with each program run. // Declare position 2... /* Your code goes here */ double distance = initial_distance; 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27} // Update distance and position1 distance distance * 0.5; position1= distance; cout << position1 << " " << position2 << endl; // Update distance and position2 /* Your code goes here */ cout << position1 << " " << position2 << endl; // Update distance and position1 /* Your code goes here */ cout << position1 << return 0; "1 << position2 << endl;