I need to solve these questions please

Q1: Multiplication of large numbers can be carried out by splitting them into two smaller numbers, each having the same number of digits. If A = A1 A2 and B = B1 B2, then A and B can be multiplied using the following formula based on the divide and conquer approach. A * B = A1 * B1 . 10^n + (A1 * B2 + A2 * B1) . 10^(n/2) + A2 * B2 Where (A1 * B2 + A2 * B1) = (A1 + A2) * (B1 + B2 ) - A1 * B1 - A2 * B2 a) Use this formula to multiply 32 and 27. Show steps. b) Write a recursive relation showing the efficiency of this method. Q.2: Multiplication of large numbers can be carried out by splitting them into two smaller numbers, each having the same number of digits. If A = A1 A2 and B = B1 B2, then A and B can be multiplied using the following formula based on the divide and conquer approach. A * B = A1 * B1 . 10^n + (A1 * B2 + A2 * B1) . 10^(n/2) + A2 * B2 Where (A1 * B2 + A2 * B1) = (A1 + A2) * (B1 + B2 ) - A1 * B1 - A2 * B2 a) Use this formula to multiply 1024 and 2143. Show steps. b) Write a recursive relation showing the complexity of this method. Q3: An algorithm's efficiency for input size n is T(n). Using the Divide and Conquer approach, we can split the input into 6 parts of equal size. The solution can be found by solving 5 smaller problems. The merging operation's efficiency is n^7. Write a recursive relation to describe the efficiency of the Divide and Conquer based solution