Write a function which reduces fractions to their simplest form! Fractions will be presented as an array/tuple (depending on the language), and the reduced fraction must be returned as an array/tuple:
```
input:   [numerator, denominator]
output:  [newNumerator, newDenominator]
example: [45, 120] --> [3, 8]
```
All numerators and denominators will be positive integers.
Note: This is an introductory Kata for a series... coming soon!
def mcd(fraccion):
    if fraccion[0]%fraccion[1]==0:
        return fraccion[1]
    else:
        return mcd((fraccion[1], fraccion[0]%fraccion[1]))

def reduce_fraction(fraccion):
    return (fraccion[0]//mcd(fraccion), fraccion[1]//mcd(fraccion))
def mcd(fraccion):
    if fraccion[0]%fraccion[1]==0:
        return fraccion[1]
    else:
        return mcd((fraccion[1], fraccion[0]%fraccion[1]))

def reduce_fraction(fraccion):
    return (fraccion[0]//mcd(fraccion), fraccion[1]//mcd(fraccion))