as i know, the signed binary, when i caculate subtract operation, i can transfer nagative binary to 2's complement and then use binary A(positive binary's 2's complement equal to the original) + binary B. But this problem is different, that are unsigned binary, there are no symble position.How to do that? and i wanan ask is that true of my know. i cacualte signed binary about 01010101 - 00111011 is equal to 01010101 + 10111011 and the 10111011 tansfer to 2's complement is 01000101 and plus 01010101 = 10011010, then no overflow, and leftmost two carry-out bits is 10. Is that true?

Please calculate the following subtractions of 8-bit unsigned binary numbers. You must write exactly 8 bits in the "result" box, and write exactly 1 bit in the "leftmost carry-out bit" box, and write yes or no (lowercase) in the "overflow" box. 1) 01010101 - 00111011 8-bit result = 00011010 leftmost carry-out bit0 overflow (yeso)= no 2) 00010110 - 10100101 8-bit result leftmost carry-out bit- overflow (yeso) =