the process of combining two sorted sequences is called asorting bshuffling cdovetailing dmerging recursion is related to the mathematical technique called alooping bsequencing cinduction dcontradiction how many steps would be needed to solve the towers of hanoi for tower of size which of the following is not true of the halting problemait was studied by alan turing bit is harder than intractable csomeday clever algorithm may be found to solve it dit involves program that analyzes other programs discussion place these algorithm classes in order from fastest to slowestn log nnn log in your own wordsexplain the two rules that proper recursive definition or function must follow what is the exact result of anagram("foo") trace recpower( , and figure out exactly how many multiplications it performs why are divide-and-conquer algorithms often very efficientprogramming exercises modify the recursive fibonacci program given in the so that it prints tracing information specificallyhave the function print message when it is called and when it returns for examplethe output should contain lines like thesecomputing fib( leaving fib( returning use your modified version of fib to compute fib( and count how many times fib( is computed in the process this exercise is another variation on "instrumentingthe recursive fibonacci program to better understand its behavior write program that counts how many times the fib function is called to compute fib(nwhere is user input hintto solve this problemyou need an accumulator variable whose value "persistsbetween calls to fib you can do this by making the count an instance variable of an object create fibcounter class with the following methods