Please help and show explicitly the solutions - and explanation too !

Read the code for the recursive function count_odd, which operates on a nested list. def count odd (obj: Union int, List]) -> int: Return the number of odd numbers in >>count odd([1, [2, 6, 5], [9, [8, 711]) 1. Based on the structure of the argument, state the three relevant recursive calls in this case, and what each one should return assning count odd is implemented correctly 2. Now, assuming all recursive calls are correct, what recursive call s) does this implementation of count_odd actually ak, and what does the overall call to count_odd([1, [2, 6, 5], [9, [8, 711]) actually return? 3. Write a correct implementation of count_odd