Write an implementation of Linear Search that is recursive. Would the Big O complexity of Linear Search be changed if it were coded recursively?

#write your answer here # implementation def rec_lin_search(li,item):

return aux_rec_lin_search(0,li,item)

def aux_rec_lin_search(i,li,item):

#check that your i is outside the list if: return #check if the item is at i elif: return #start the recursive process else: return