Give an efficient algorithm to convert a given -bit (binary) integer to a decimal representation. Argue that

Give an efficient algorithm to convert a given β-bit (binary) integer to a decimal representation. Argue that if multiplication or division of integers whose length is at most β takes time M(β), then we can convert binary to decimal in time Θ(M(β) lg β). Use a divide-and-conquer approach, obtaining the top and bottom halves of the result with separate recursions.)