By Python write the code required..

Recursion - Nested Lists It would be handy to have a procedure that allows accessing lists that are nested to arbitrary depth. It would take a nested list and some sort of an index, and return the part of the list at that index. The item at that index could be a primitive type such as a number or a string, or it could be another list. Consider this (very complicated) nested list: nested 4 15, 61, 7 [8, 9, 10], If we access the fourth index of the list, we get: nested[3] -> [8, 9, 10] If we then look up the second index in that list, we will get back a primitive value: nested[3111] -> 9 So we can say that if we look up the 'index path' of 3 -> 1 we get the value 9