(A) Suppose that we break an n bit integers to three n 3 bit integers (namely the first, middle, and last bits.) (I) If a recursive integer multiplication algorithm then completes multiplication by performing (a)4 multiplications of n 3 bit integers and (b)some addition linear amout of work, then what is the running time in O notation? (II) If a recursive integer multiplication algorithm then completes multiplication by performing (a)8 multiplications of n 3 bit integers and (b)some addition linear amout of work, then what is the running time in O n log3? notation? How does this running time compare to O n 1.5849... ? (II) Suppose again that we break an n bit integers to three n 3 bit integers. Suppose that a recursive algorithm can completes multiplication by performing (a)x multiplications of n 3 bit integers and (b)some addition linear amout of work. What is the largest value of x that this algorithm results in a running time faster than O n 1.5849... ? What is the running time for this value of x? -Write a sentence explaining your answer. (B) Suppose again that we break an n bit integers to ten n 10 bit integers. Suppose that a recursive algorithm can completes multiplication by performing (a)y multiplications of n 10 bit integers and (b)some addition linear amout of work. Where x be the answer of question (A. II), what is the largest value of y that this algorithm results in a