4 . The Number of levels in a Wallace tree multiplier is (A) and the total time...

$4.$   

Transcribed Image Text:

The Number of levels in a Wallace tree multiplier is (A) and the total time complexity of the Wallace tree multiplier for performing an n-bit multiplication is (B). A log3/2(n) n/2 log3/2(n) + 1 n B O(n) O(nlog(n)) O(n) O(log(n)) (2) The Number of levels in a Wallace tree multiplier is (A) and the total time complexity of the Wallace tree multiplier for performing an n-bit multiplication is (B). A log3/2(n) n/2 log3/2(n) + 1 n B O(n) O(nlog(n)) O(n) O(log(n)) (2)