N2 Naive Standard Algorithm Multiplying Two N Bit Binary Integers X Y Costs Divide Conque Q37191393

please answer correctly.Thanks

(n2). A naive The standard algorithm for multiplying two n-bit binary integers x and y costs divide-and-conquer algorithm is to let-2n/2a + b and y = 2n/2e+ d, then (2n/2a + b) (20% + d) = 2nac + 2n/2 (ad + bc) + bd zy = The complexity is T(n) = 4T() +6(n) = Θ(n2). There is no improvement to the standard algorithm. (a) By observing that ad+bc (a +b)(c + d) – (ac + bd),

OR

 

OR