algorithm design and recursion the python operator in performs binary search binary search is an log algorithm the number of times can be divided by is exp( all proper recursive definitions must have exactly one non-recursive base case sequence can be viewed as recursive data collection word of length has nanagrams loops are more general than recursion merge sort is an example of an log algorithm exponential algorithms are generally considered intractable multiple choice which algorithm requires time directly proportional to the size of the inputalinear search bbinary search cmerge sort dselection sort approximately how many iterations will binary search need to find value in list of itemsa recursions on sequences often use this as base casea can empty sequence dnone an infinite recursion will result in aa program that "hangsba broken computer ca reboot da run-time exception the recursive fibonacci function is inefficient because ait does many repeated computations brecursion is inherently inefficient compared to iteration ccalculating fibonacci numbers is intractable dfibbing is morally wrong which is quadratic time algorithmalinear search bbinary search ctower of hanoi dselection sort