These three questions are going done by phyton code.

I. Write a recursive function that sums all the numbers up to n, which should be given as an argument to your function. search is a search algorithm that works on sorted lists. The idea is t the element at the middle of the list, and go on with the same strategy with either the upper half or the lower half, depending on whether the search item is greater or smaller than the middle element. This recursive search item. Write two functions: a recursive binary search function, and a function that takes a list, sorts it use your own sorting function, builtin sort is NOT allowed- and sends the sorted list to your recursive binary search function. 3. Use your previous solution to write a program that takes a search term and a text file as inputs, and returns whether the search term is in the file or not