$3\mathrm{.}2$ Write a Java function named $$reduce$$ that takes one argument, which is an array containing two positive integer values, treats them as the numerator and denominator of a fraction, and reduces the fraction. That is to say, each of the two elements will be modified by dividing it by the greatest common divisor of the two integers. The function should return the value false $($to indicate failure to reduce$)$ if either of the two arguments is zero or negative and should return the value true otherwise. $(15$ Marks$)$