Rewrite the gcd function that uses Euclids algorithm so that it computes the greatest common divisor recursively using the following rules: If y is zero, then x is the greatest common divisor. Otherwise, the greatest common divisor of x and y is always equal to the greatest common divisor of y and the remainder of x divided by y.

Use one page for HTML, input and output and create a second javascript file it is linked to.