MUST BE COMPLETED IN PYTHON PLEASE :)

List details:

monotonically decreasing, L[:k+1]

monotonically increasing, L[k:]

Write a function "find_min" that finds the minimum item in a list sorted as described above.

find_min(L, m):

O(logn)

Returns the smallest item in a list L sorted as described above. Return the value, not the index.

m is the maximum number of times an item in the list repeats. Remember, there are no duplicate values on the increasing and decreasing halves (except for the minimum value).

Transcribed image text