Question: Python Please use recursion to implement Takes a list of integers and returns a list identical to aList, but when a negative number appears, the
Python
Please use recursion to implement
Takes a list of integers and returns a list identical to aList, but when a negative number appears, the function deletes the negative number and the next x-1 elements, where x is the absolute value of the negative number. The function should not mutate aList.
start code:

def removing (aList, a 0): >>> removing ( [7, 4, 0]) [7, 4, 0] >>> myList=[7, 4, -2, 1, 9] >>> removing (myList) # Found (-2) Delete -2 and 1 [7, 4, 9] >>> myList [7, 4, -2, 1, 9] >>> removing([-4, -7, -2, 1, 9]) # Found (-4) Delete -4, -7, -2 and 1 [9] >>> removing([-3, -4, 5, -4, 1]) # Found (-3) Delete -3, -4 and 5. Found (-4) Delete -4 and 1 []
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
