Problem
Write a function ged(x, y) that returns the greatest common divisor of the parameters a and y. Use the Euclidean algorithm to do this. If the ged doesn't exist (i.e., if both a and y are ()), return None. You may assume that both parameters are non-negative integers.