Python Question

Consider the following recursive function in Python that computes the minimum element from a list def 1st_min(lst) # missing m1st min(1st 1:1 return 1st[0] if 1st[0]m else m What lines of code could replace part A that is missing? if len(1st) 1: return 1st[:-1] if len (1st)1: return 1st[] if len (1st)0: raise IndexError() if st.count () 1: return 1st[] if len (1st)0: return 10000000