What is a potential problem with the built-in sort used by lists? The built-in sort can fail when there are both float and integer values in a numeric list. O Sort only works with string data. O String values are not sorted alphabetically when upper and lowercase characters are used. O Sort only works with numeric data.

Write a python program that takes two lists, merges thetwo lists, sorts the resulting list, and then finds the median of theelements in the two lists. You cannot use python build-in sort() function #todo#You can use math functions like math.floor to help the calculationimport math #todo#You can use math functions like math.floor to help the calculation import math def task7(list_in_1, list_in_2):  # YOUR CODE HERE                return median please use these variables no print function please

in python please

Write a version of the binary search algorithm that can be used to search a list of strings. (Use the selection sort that you designed to sort the list.)

A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary.   -----------------------------------------------------------------------------------   """ File: search.py Project 11.1 """ def sequentialSearch(target, lyst):     """Returns the position of the target item if found,     or -1 otherwise.     The lyst is assumed to be sorted in ascending order."""     position = 0     while position < len(lyst):         if target == lyst[position]:             return position         position += 1     return -1 def main():     """Tests with three lists."""     print(sequentialSearch(3, [0, 1, 2, 3, 4]))     print(sequentialSearch(3, [0, 1, 2]))     # Should stop at second position.     print(sequentialSearch(3, [0, 4, 5, 6])) if…