Use Python: A list L contains some lists. Each list in L contains some numbers. Use Python map to sort the grades for each list in L. Example: L= [[3,2,1], [5,4,6], [9,8,7]] Output: [[1, 2, 3], [4, 5, 6], [7, 8, 9]]

def second_largest(lst: List[int]) -> int:    """    Given a list <lst> of integers, return the second largest item in the list    without modifying <lst>. You cannot use any of python's builtin sorting    functions. Do not attempt to sort the list yourself either.     For example, an input [1, 2, 3] should return an output of 2, since 2 is    the second largest integer in the list.     Note that when we say second largest, we do not mean second largest    distinct element. That means that [1, 2, 4, 4] should return 4, not 2.    """don't use any imports,or any dictionaries, or dictionary methods.and try-except statements

Int[] list = {7,14,26,43,46,50,81} and the length= 7 (binary search Algorithm) use the sorted list above  and fill out the table for 3 different cases: Search for the value that is in the table. Search for the value that is greater than any value in the list. Search for the value that is smaller than any value in the list.

in #lang scheme