Python help Using any sorting algothrim create only one function def sortstring(filename): that takes in a file which has a bunch of sentences, each line of sentence consting of different length. Sort the setences from the lower length senteces to the highest length sentence. Print it after ( DON'T USE ANY SORTING BULT-IN FUNCTION ).  Note: Keep note of time complexity as it should be able to run few 10,000 lines of sentences in few seconds.

Python

Use python when completing the question:   Write a function interleaved that accepts two sorted sequences of numbers and returns a sorted sequence of all numbers obtained by interleaving the two sequences. Guidelines: each argument is either a list or a range assume that each argument is sorted in non-decreasing order (goes up or stays the same, never goes down) you are not allowed to use sort or sorted (or any other form of sorting) in your solution you must interleave by iterating over the two sequences simultaneously, choosing the smallest current number from each sequence. Output:  >>> interleaved( [-7, -2, -1], [-4, 0, 4, 8]) [-7, -4, -2, -1, 0, 4, 8]   >>> interleaved( [-4, 0, 4, 8], [-7, -2, -1]) [-7, -4, -2, -1, 0, 4, 8]   >>> interleaved( [-8, 4, 4, 5, 6, 6, 6, 9, 9], [-6, -2, 3, 4, 4, 5, 6, 7, 8]) [-8, -6, -2, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 8, 9, 9]   >>> interleaved( [-3, -2, 0, 2, 2, 2, 3, 3, 3], [-3, -2, 2, 3]) [-3, -3, -2, -2, 0,…

Make new code please