DescriptionRecursive GCDGiven two integers a and b, write a recursive function to calculate the greatest common divisor (GCD) of a and b.InputThe input contains two integers separated by a space a and b (1 β€ a, b β€ ).OutputThe program should print the GCD of a and b.ExamplesInputOutput8 1245 2557 131Β ConstraintsTime limit: 0.2 secondsMemory limit: 512 MBOutput limit: 1 MBTo check your solution you need to sign in