I need some help with the following problem.

Trace through the following algorithm, if it is invoked as GCD(10, 6). Use a top-down evaluation. (Recall that "n mod m" is the remainder when n is divided by m. ) function GCD(m, ne {0, 1, 2, 3, ...}) if n = 0 then return m else return GCD(n, m mod n) GCD (10, 6) = GCD = GCD = GCD