Python functions called satisfies(L) and f(s) that has the specification below. Write a Python function called satisfies that has the specification below. Then make the function call run_satisfieaf(L, satisfieaf). Your code should look like: def satisfies (L) : Assumes Lia a list of atringa Assume function f is already defined for you and it maps a string to a Boolean Mutates L such that it contains all of the strings, s, originally in L sueh that f(s) returns True, and no other elements. Remaining elements in L should be in the same order. Returns the length of Lafter mutation Your function implementation here runsatisfient(t, satisfies) For your own testing of satisfies, for example, see the following test function test code: and The function f, run satisfiesF, and input L are defined as: def f(s): return 'a' in s def run_satisfiesF(L, satisfiesF): print (satisfiesF(L)) L - ['a', 'b', 'c'] Your running results should look like: run_satisfiesF(L, satisfiesF) ['b', 'c'i