Question: The Russian peasant method is used to multiply two n-digit numbers.
(a) Find a reasonable upper bound for the number of rows required by this process, that is, for the number of multiplications and divisions by 2.
(b) Find a reasonable upper bound for the number of basic operations required in the multiplying and dividing by 2.
(c) Find a reasonable upper bound for the number of basic operations required by the final addition.
(d) Show that the number of basic operations in all is 0(n2).
Count as basic operations
*the addition of two single-digit numbers,
*the multiplication of two single-digit numbers, and
*the division of a 2-digit number by a single digit number.