Consider the following Python procedures. For each one, specify its order of growth def lenRecur (s): if s return 0 else return 1 lenRecur(s 1 Select an option 2. def isIn. (a s) a is a character or, singleton string s is a string, sorted in alphabetical order if len (s) 0 return False elif len(s) 1: return a s else test s [len (s) //21 if test return True elif a test return isIn(a, SC :len (s) /2 else return isIn, (a, s[ len (s) //2+1