Part B: Recursion 1 [2 marks] Consider the following recursive function. There are no syntax errors def mystery (aList): if len (aList)-= 0: If aList[0] % 5 == 0: else: return O return 10 + mystery (aList[1:]) return 1 + mystery (aList[1:]) What is returned by the call mystery([10, 7, 3, 0, 151)? 2. [3 marks] Consider the following recursive function. There are no syntax errors def mystery (aList): if len (aList) 0 : return None == 1: return aList[0] if len (aList) mid = len (aList) //2 right = mystery (aList[mid:)) left - mystery (aList[0:mid]) if right