Question

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 <obj if isinatance (obj, int): íf obj % 2-0: return else: return 1 else: for sublist in obj: return count_odd (sublist) Answer the questions below about the following call to count.odd. >>>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

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

Answer 1

recurs、vely calls: ca i) three rdavent ing the d is orred Since, e are as umi Nou, tke ag ument is do, it gecs to else in else dlor next s recursive calls ere count-odaC lctuns → 3) courtedd (trb r 5) //returns l sina thisis olso a list nant recursi ve cal will be returns i → s) coent-Odd (@j ere autfud de·repren勿 all ea 1, becaw ading amy thi frem previoos calls st simply returnim the result、 the odd ( Cı, t2,6 5]ノ[A.cs,끄3] CAYRS /

def cwont ode Cobj Union Cint, Lis3) >in rdcurn o else: return else: for sub list in obj s: st count-odd(sub list) # adding count