write a Python function that takes in a list of integers (elements), checks whether the list is sorted or not, and returns True of False accordingly. You MUST provide the most efficient algorithm in terms of its time and space complexity. What is the time and space complexity of your algorithm/function? def is_sorted(my_list)

I am to write a python function Given a list of integers L and an integer n, then compute the sum of the first n elements of L, or the sum of the whole list if it has less than n elements

Implement a function findMixedCase in Python that: accepts a single argument, a list of words, and returns the index of the first mixed case word in the list, if one exists, (a word is mixed case if it contains both upper and lower case letters), and returns -1 if the all words are either upper or lower case. sample: >> findMixedCase( ['Hello','how','are','you'] ) # 'Hello' is mixed case0

Given a list called L. I am to write a function in python that will return two lists, one list with all the elements that are even, and the other list with all the elements that are odd.  L = [1,2,3,4,5,6,7,8,9,0]