Python Using recursion only No loops, no list method Using such type()function, len()function, indexing, slicing The function must return true(boolean) if a list has positive numbers otherwise returns false   def hasPosNum(lst):

IN PYTHON THANK YOU

Objective: Write syntactically correct while/for loops Given a list of numbers and a number n, return the sum of the first n elements in the list. Assume n is less than or equal to the length of the list. For example, given [1, 1, 1, 5] and n=3, the function should return 3. (i.e. 1+1+1) user_code.py 1 # starter code 2 def sum_to_n(numbers, n): 3 4 & in 5 # your code here (replace pass with your code) *

A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary.   -----------------------------------------------------------------------------------   """ File: search.py Project 11.1 """ def sequentialSearch(target, lyst):     """Returns the position of the target item if found,     or -1 otherwise.     The lyst is assumed to be sorted in ascending order."""     position = 0     while position < len(lyst):         if target == lyst[position]:             return position         position += 1     return -1 def main():     """Tests with three lists."""     print(sequentialSearch(3, [0, 1, 2, 3, 4]))     print(sequentialSearch(3, [0, 1, 2]))     # Should stop at second position.     print(sequentialSearch(3, [0, 4, 5, 6])) if…