Euclid By Recursion

Complete gcd(a: int, b: int) -> int so it returns the greatest common divisor of two non-negative integers using Euclid's algorithm. The base case is written: when b is 0 the answer is a. Add the recursive case, which returns the gcd of b and the remainder of a divided by b, written with the remainder operator %. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: two lines, a then b, no prompts, which the tests read and pass to your function before printing the value it returns.