(Subtraction Logic) The truth table for a 1-bit combinational binary subtractor, analogous to the half adder, computing D(ifference) = A minus B, with BL (borrow-from-left), is
(a) Design a 1-bit combinational binary subtractor, comparable to the full adder, with two data inputs (A, B), a borrow from the right input (BI), a borrow request to the left output (BL), and a difference output (D).
(b) Show how your design can be cascaded to form multi-bit subtractors.
(c) Does the subtractor work correctly for negative two com-plement numbers?
(d) How is a subtraction under/low condition indicated?