using the basic form of the euclidean algorithm, compute the greatest common divisor of
(1) 5436 and 11382;
(2) 2295 and 455