This Question must be proven using mathematical induction

1: procedure GCD(a, b: positive integers) 2 if a b then return a 3: 4: else if a b then 5: return GCD (a -b, b) 6: else return GCD(a,b-a) 8: end procedure Let P(a, b) be the statement: GCD(a, b)-ged(a,b). Prove that P(a, b) is true for all positive integer a and b