Convert the following decimal expansion ( 150 )10 to an 8-bit binary expansion. Much appreciated if this can be broken down step by step.

Evaluate the following expressions, in which each operand is an 8 bit 2’scomplement number, using the standard binary addition algorithm (evaluate thesubtraction in part (a) by negating then adding). As well as showing each result in 8 bit2’s complement, also convert and express each as a signed decimal number. Note thatwhenever there is signed overflow your answer will not be correct. For whichexpression(s) does this occur?(a) 11111111 - 01111111 (b) 10111010 + 11000010 (c) 10111110 + 11010111

Perform the following operations by converting the operands to 2’s complement binary numbers and then doing the addition or subtraction shown. Please show all work in binary, operating on 8-bit numbers. Is there an overflow?(a) 48 + 96(b) -45 - 28(c) -67 - (-41)

Solve the two questions please