Write a recursive Python function named initList to create a list containing the values from 0 to n-1. • The function takes two parameters, a reference to the list and an integer which is the value n. In the main program you must: - initialize a list (L = []) - call the recursive function initList with this list L, to modify it - and, ask the user to enter the value n from the keyboard

Construct recursive versions of the library functions that: a. calculate the "sum" of a list of numbers. b. "take" a given number of elements from the beginning of a list. c. select the "last" element of a non-empty list .

Solve in C++ using the given code and avoid using vectors

Complete the recursive function remove_last which creates a new list identical to the input list s but with the last element in the sequence that is equal to x removed. Hint: Remember that you can use negative indexing on lists! For example 1st [-1] refers to the last element in a list 1st, lst [-2] refers to the second to last element... def remove_last(x, s): """Create a new list that is identical to s but with the last element from the list that is equal to x removed. >>> remove_last(1, []) [] >>> remove_last(1, [1]) [] >>> [1] >>> [2] remove_last(1, [1,1]) remove_last(1, [2,1]) >>> remove_last(1, [3,1,2]) [3, 2] >>> remove_last(1, [3,1,2,1]) [3, 1, 2] >>> remove_last (5, [3, 5, 2, 5, 11]) [3, 5, 2, 11] IIIII "*** YOUR CODE HERE ***" Illustrated here is a more complete doctest that shows good testing methodology. It is a little cumbersome as documentation, but you'll want to think about it for your projects. Test every condition that might come up. Then you won't be surprised when…

IN PYTHON THANK YOU

Python

in c++ please paste working code. the program should  Input- Julia Lucas Mia -1 With an expected output of-  Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia