Problem

Write a recursive function called list$\_$math that takes a list of

non$-$zero integers as a parameter. Return the recursive

quotient for the numbers in the list.

Expected Output

If you test your function with the following code:

# test code below

$if{?}_{(}(){)}_{n}am{e}_{{?}_{?}}=={?}_{(}(){)}_{m}ai{n}_{{?}_{?}}$:

$exampl{e}_l$ist $=[1,20,7,2]$

print$(lis{t}_m$ath$(exampl{e}_l$ist$))$

It should produce the output:

What does if$\_$name$\_==""$: mean?

If you test your function with the following code:

# test code below

$if{?}_{(}(){)}_{n}am{e}_{{?}_{?}}=={?}_{(}(){)}_{m}ai{n}_{{?}_{?}}$:

$exampl{e}_l$ist $=[8,7,18,14]$

print$(lis{t}_m$ath$(exampl{e}_l$ist$))$

It should produce the output:

Use the Playground below to check your code. Click the

button to evaluate your work.