Above is a partially defined recursive function that will cr…

Above is a partially defined recursive function that will create a wave pattern based on the input s. Below is an example output: Answer the following 1. (3 points) Complete the base case statement at Line 3 for the base case. 2. (3 points) Add a single line of code at Line 6 for the recursive call.

Here is the merge sort function from lecture Rather than so…

Here is the merge sort function from lecture Rather than sorting the input based on values, suppose we want to allow the user to provide a function (or lambda) to sort any iterable input. 1. (3 points) Update the function call to support a second input called ‘key’ and set the default to be a lambda that returns the input (unchanged, i.e. the identity function f(x) = x). 2. (2 points). Which single other line of code should be updated to use this key for sorting the elements? Write the updated line of code.  2. (3 points) Which line(s) represent the recursive call(s)?