Multiply By Adding

Complete multiply(a: int, b: int) -> int so it returns a times b using only addition and recursion, for a b of 0 or more. The base case is written: anything times 0 is 0. Add the recursive case, which returns a plus the product of a and b - 1. 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.