2.1 (HW2, with solution, DC): 2.1. Use the divide-and-conquer integer multiplication algorithm to multiply the two binary integers 10011011 and 10111010. OJO: Not sure if this below graph will be provided: [DPV] 2.1 Use the divide-and-conquer integer multiplication algorithm to multiply the two binary integers 10011011 and 10111010. This tree displays the return values from each level of the recursion; the values are ordered A,B,C for the formula return = A x 2" + (C - A - B) x 2"/2 + B 28,830 99 110 420 4 3 15 4 6 20 1 20 30 1 0 1 0 1 2 0 3 6 1 0 1 1 0 2 1 0 2 0 1 1 1 0 2 1 2 0 0 1 0 0 0 0 1 2 1 0 2 0 0 1 0 1 1 0 0 0 0 0 1 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 0|0 1 1 0 2 0|0 1 0 0 1 0 0 1