Expected Behavior Write a Python function kth elements(L, k) that takes as arguments a list and an integer k, and returns a list consisting of the elements of i at positions that are divisible by k. (Your solution need not do anything special for 0: n this case, it is OK to let Python generate an exception.) Your solution should use list comprehensions only. It should not use any other control statements-i.e, no if, for, while, or try statements, except as needed within the list comprehension Examples 1. Call: kth elements (11,22,33,44, 55, 66,77,88,99,111], 2) Result: [11,33,55,77,99] Call: keholemonts(l1,22,33,44,55,66,77,88,99,1111, 3) Result:1,44,77,111 . Call: kth elements(11,22,33,44,55,66,77,88,99,111 5 Result: [11,661 4. Call: kthelements(11,22,33,44,55,66,77,88,99,111,999 Result