Python recursion

Below, you are given a recursive implementation for the function: def min_in_lst(lst, low, high) This function gets the list of integers lst, as well as two indices: low and high (low s high), which indicate the range of indices of the elements that should to be considered. When called, the function would return the minimum value out of all of elements in the low, low+1, , high positions. def min_in_lst(lst, low, high): if(lowhigh) return lst [low] mid_ind(low high) 2 min2 min_in_lst(lst, mid ind 1, high) else: if(min1