Consider the binary numbers x = 10011011 and y = 10111010. decomposing x using a = 1001 , b = 1011 and y using c = 1011, d = 1010, compute the product xy using the ordinary way and the way done in div

Consider the binary numbers x = 10011011 and y = 10111010. decomposing x using a = 1001 , b = 1011 and y using c = 1011, d = 1010, compute the product xy using the ordinary way and the way done in divide-and-conquer method by forming w1 = a + b, w2 = c + d, u = w1w2, v = ac, w = bd. recall xy = 2nv + 2n/2 (u − v − w) + w. each multiplication by 2 amounts to a shift. count the binary operations in each method.