prove Goldbach's Conjecture for all even integers between four and

one million, inclusive.

Implement a method with the following declaration:

public static void sieve(int[] array);

This function takes an integer array as its argument. The array

should be initialized to the values 1 through 1000000. The

function modifies the array so that only the prime numbers remain;

all other values are zeroed out.

This function must be written to accept an integer array of any

size. You must should output for all primes numbers between 1 and

1000000, but when I test your function it may be on an array of a

different size.

Implement a method with the following declaration: