Write a Python function countEvens that consumes an integer N and a nested list representing a matrix of arbitrary size (but larger than NxN).  The function returns the number of even numbers in the NxN sub-matrix of the first N rows and columns.  Note: You may assume the list argument passed to the function is a nested list of integers, but it may be larger than NxN!

Write a function called find_duplicates which accepts one list as a parameter.    This function needs to sort through the list passed to it and find values that are duplicated in the list. The duplicated values should be compiled into another list which the function will return. No matter how many times a word is duplicated, it should only be added once to the duplicates list.   NB: Only write the function. Do not call it.   For example: Test Result random_words = ("remember","snakes","nappy","rough","dusty","judicious","brainy","shop","light","straw","quickest", "adventurous","yielding","grandiose","replace","fat","wipe","happy","brainy","shop","light","straw", "quickest","adventurous","yielding","grandiose","motion","gaudy","precede","medical","park","flowers", "noiseless","blade","hanging","whistle","event","slip") print(find_duplicates(sorted(random_words))) ['adventurous', 'brainy', 'grandiose', 'light', 'quickest', 'shop', 'straw', 'yielding']…

-python- Write a function called get_words that takes a list of words and a letter,and returns a new list, which only contains the words that don't have the given letter in them. For example, get_words(["cat", "dog"], 'o') should return ["cat"] and get_words(["cat", "bat"], 'a') should return an empty list.

In Python IDLE: How would I write a function for the problem in the attached image?