Write a function dot(vals1, vals2) that takes as inputs two lists of numbers, vals1 and vals2, and uses recursion to compute and return the dot product of those lists i.e., the sum of the products of the elements in the same positions in the two lists. For example, the dot product of [1, 2, 3] and [4, 5, 6] is 1*4 + 2*5 + 3*6 or 32. If the two lists do not have the same length or if either list is empty, dot should return 0.0. Here are some other examples: >>> dot([5, 3], [6, 4]) # get a decimal because the base case returns 0.0 result: 42.0 >>> dot([1, 2, 3, 4], [10, 100, 1000, 10000]) result: 43210.0 >>> dot([5, 3], [6]) result: 0.0 This function is somewhat similar to the the mylen function from lecture, but it needs to deal with lists instead of strings, and it needs to process two lists at the same time. You can find a modified version of mylen that handles both strings and lists here. Write a function add_spaces(s) that takes an arbitrary string s as input and uses recursion to form and return the string formed by adding a space between each pair of adjacent characters in the string. If the string has fewer than two characters, it should be returned without any changes. Here are three examples: >>> add_spaces('hello') result: 'h e l l o' >>> add_spaces('hangman') result: 'h a n g m a n' >>> add_spaces('x') result: 'x' This function is somewhat similar to the the replace function from lecture, because it needs to recursively create a new string from an existing string. However, your function will be simpler, because it wont need to decide what to do after the recursive call returns.