using Matlab

% - % a) Initialize and populate an array x with length 1000, where x has the % following two properties: % i) all entries of x are prime numbers % ii) x(1) + x(2) = 4, x(3) + x(4) = 6, x(5) + x(6) = 8, etc. % WRITE CODE BELOW: % b) If it turns out that the Goldbach conjecture is FALSE, what % does this mean about the algorithm you implemented above? If you made the % array x longer, will your code neccesarily work? Explain. % WRITE COMMENT BELOW