1. The problem is to subtract two binary numbers in base 2. 2. The subtraction rule in base 2 is similar to decimal subtraction but uses binary digits (0 and 1). 3. Important rules: - 0 - 0 = 0 - 1 - 0 = 1 - 1 - 1 = 0 - 0 - 1 requires borrowing from the next higher bit. 4. Example: Subtract $1011_2$ (11 in decimal) minus $110_2$ (6 in decimal). 5. Align the numbers: $1011_2$ - $0110_2$ 6. Start from the right: - $1 - 0 = 1$ - $1 - 1 = 0$ - $0 - 1$ requires borrowing: borrow 1 from the leftmost bit, making it $10_2$ (2 in decimal), so $10 - 1 = 1$ - After borrowing, leftmost bit is $0 - 0 = 0$ 7. Result is $0101_2$, which is $101_2$ or 5 in decimal. 8. So, $1011_2 - 110_2 = 101_2$. This shows how to subtract binary numbers using borrowing when needed.