Need help in the follow discrete mathematics

5. The recursive algorithm given below can be used to compute god(a, b) where a and b are non-negative integer, not both zero. procedure god(a, b) if a > b then god(a, b) := god(b, a) else if a = 0 then god(a, b) := b else if a = 1 then god(a, b) := 1 else if a and b are even then god(a, b) := 2ged(a/2, b/2) else if a is odd and b is even then god(a, b) := ged(a, b/2) else god(a, b) := god(a, b - a) Use this algorithm to compute (a) god(124, 244) (b) god(4424, 2111). (3 + 3 = 6 marks)