Here’s the translated code from Python to Java, maintaining the original logic and functionality: ### Translated Java Code: ```java public class PrimeNumberPrinter { // Method to check if a number is prime public static boolean isPrime(int number) { if (number <= 1) { return false; } for (int i = 2; i < number; i++) { if (number % i == 0) { return false; } } return true; } // Method to print prime numbers in a given range public static void printPrimeNumbersInRange(int start, int end) { for (int num = start; num <= end; num++) { if (isPrime(num)) { System.out.println(num); } } } public static void main(String[] args) { // Call the method to print prime numbers in the range 10 to 50 printPrimeNumbersInRange(10, 50); } } ``` ### Explanation of Changes: 1. **Class Structure:** - Java requires a class structure, so the code was encapsulated in a class named `PrimeNumberPrinter`. 2. **Method Declaration:** - In Java, methods must have explicit access modifiers (`public`, `static`), return types (`boolean` for `isPrime`), and parameter types (`int` for `number`, `start`, and `end`). 3. **Loops and Conditions:** - Java uses the `for` loop and `if` statement in similar fashion to Python, but the syntax requires explicit type declarations (e.g., `int i`). 4. **Printing Output:** - Java uses `System.out.println()` to print output, whereas Python uses `print()`. ### Edge Cases and Testing Scenarios: 1. **Input Values Below 2:** - Test with `start = 1` and `end = 1` or any range where no prime numbers exist (e.g., `start = 0`, `end = 0`). 2. **Range with Only One Prime Number:** - Test with a range where the only prime number is the upper or lower bound (e.g., `start = 2`, `end = 2`). 3. **Large Numbers:** - Check performance with larger values (e.g., `start = 1000`, `end = 10000`) to see if the prime number check remains efficient. Let me know if you need further details or adjustments!