Convert the following segment into an equivalent while loop [2] int x, c;for(x = 10, c = 20; c >10; c = c–2)x++;

Convert the following segment into an equivalent while loop [2] int

1.	Convert the following segment into an equivalent while loop [2] int x, c;for(x = 10, c = 20; c >10; c = c–2)x++;
Answer» java.util.Scanner;public class FiftyPrimes{ // RETURN true if a number n is PRIME public static boolean isPrime(long n) { // Check division from 2 to sqrt(n) for (long i = 2; i <= Math.sqrt(n); i++) { if (n % i == 0) { return FALSE; } } // If no division is found, number is prime return true; } public static VOID main(String[] args) { // Create Scanner object Scanner sc = new Scanner(System.in); // Take user input System.out.print("Enter the starting point: "); long start = sc.nextInt(); // Close Scanner object sc.close(); // If start point is less than 2, make it 2 if (start < 2) { start = 2; } int numberOfPrimes = 0; // Number of primes printed long number = start; // Number to be tested for prime // ITERATE until 50 primes are printed while (numberOfPrimes < 50) { if (isPrime(number)) { System.out.println(number); numberOfPrimes++; } number++; } }}