@@ -0,0 +1,1277 @@
+import java.util.ArrayList;%0Aimport java.util.List;%0Aimport java.util.Scanner;%0A%0Apublic class PrimesInGivenRange %7B%0A    public static void main(String%5B%5D args) %7B%0A        Scanner scanner = new Scanner(System.in);%0A        int startNumber = Integer.parseInt(scanner.nextLine());%0A        int endNumber = Integer.parseInt(scanner.nextLine());%0A        List%3CInteger%3E primeList = findPrimesInRange(startNumber, endNumber);%0A%0A        for (int i = 0; i %3C primeList.size(); i++) %7B%0A            System.out.print(primeList.get(i));%0A            if (i != primeList.size() - 1) %7B%0A                System.out.print(%22, %22);%0A            %7D%0A        %7D%0A    %7D%0A%0A    private static List%3CInteger%3E findPrimesInRange(int startNum, int endNum) %7B%0A        List%3CInteger%3E primesList = new ArrayList%3C%3E();%0A        for (int i = startNum; i %3C= endNum; i++) %7B%0A            boolean primeCheck = true;%0A%0A            if (i == 0 %7C%7C i == 1) %7B%0A                primeCheck = false;%0A            %7D%0A            else %7B%0A                for (int j = 2; j %3C= Math.sqrt(i); j++) %7B%0A                    if (i %25 j == 0) %7B%0A                        primeCheck = false;%0A                    %7D%0A                %7D%0A            %7D%0A%0A            if (primeCheck) %7B%0A                primesList.add(i);%0A            %7D%0A        %7D%0A%0A        return primesList;%0A    %7D%0A%7D%0A

Create 07.PrimesInGivenRange.java