5. O-17 points HunterDM3 5.1.017. My Notes Ask Your Teacher Trace through the following algorithm, if it is invoked as GCD(42, 9). Use a top-down evaluation. (Recall that "n mod m" is the remainder when n is divided by m.) function GCD(m, n E (0, 1, 2, 3,...)) if n=0 then return m else return GCD(n, m mod n). GCD(42, 9) GCD - GCD - GCD