find both the quotient and remainder

1. (15 points) Divide 10101110 (an 8 bit, 2's complement number) by 00000110. Find both the Quotient and Remainder. Then use binary multiplication to prove the (positive) quotient & remainder are correct. Then convert the quotient & remainder into negative values. (Hints: First convert dividend to positive value, divide, then check the positive numbers, then convert both quotient and remainder to negative 8 bit values.) Da Multinlication