this is python Suppose stuff is a three-dimensional jagged array of integers such that each row may have a different number of columns. Using an index-based approach, fill in the missing parts of the following code, which should print the sum of any odd integers located in odd-indexed cells in the array. (Odd-indexed means that every index associated with a particular cell is an odd integer.) You may assume that the each dimension contains at least two values. Be certain to make your solution as efficient as possible; don't do work that doesn't contribute to the answer.

total=

for g in ____:

for t in_____:

for h in ____:

if _____:

total= _______

_______