a. Multiplying two n-bit integers u and v straightforwardly requires O(n^) steps. By using the divide-and-conquer approach, we can split the number into two equal parts and compute the product by the following method: uv = (a. 21/2 + b).(c.21/2 + d) = ac.2" + (ad + bc).2012 + bd, where ad + bc is computed as (a + b)(c + d) bd. Set up a recurrence relation T(n) for the number of multiplications made by computing u.v and solve the recurrence by the backward substitution method for n = 2k. [4 marks] - ac- a. Multiplying two n-bit integers u and v straightforwardly requires O(n^) steps. By using the divide-and-conquer approach, we can split the number into two equal parts and compute the product by the following method: uv = (a. 21/2 + b).(c.21/2 + d) = ac.2" + (ad + bc).2012 + bd, where ad + bc is computed as (a + b)(c + d) bd. Set up a recurrence relation T(n) for the number of multiplications made by computing u.v and solve the recurrence by the backward substitution method for n = 2k. [4 marks] - ac