NO FOR LOOPS

Write a recursive function findMaxLenSet) that takes an arbitrarily nested list as a parameter and returns the length of the biggest set found in the list. If the list is empty or the list does not contain any sets, then the function returns 0. Recall that you can determine whether an item is a list by writing type(item)-list and whether an item is a set by writing type(item) -set. The only list functions you are allowed to use are leno. max), indexing (Ist[i] for an integer i), or slicing (lst[i:j] for integers i and j). Note that although you are allowed to use the max) function, the function must use recursion as the primary problem-solving tool. You will know you're on the wrong track if you ever try to apply max() to the entire list. Instead it should be used to determine which of a small number of values that were computed using recursion should be returned. You should assume that the parameter provided to the function is a list, and the function is not required to do anything sensible when given something other than a list. The function should not alter the list in any way nor should it make a copy of the list and alter that. The following shows several sample runs of the completed function. Please be aware that these are just examples. The function must work correctly on all lists, and you may not make any assumptions about the values found in the list: Python 3.7.0 Shell File Edit Shell Debug Options Window Help >>> val = findMaxLenSet([]) >>val >>val >>> val >>val findMaxLenset(['test', [[[[[{1, 2}], {3, 4, 5}]]]], 'cat', {6, 7, 8, 'nine ', 10}]) >>val >>val Ln: 93 Col: 4