For FSMS with the following numbers of states, indicate the smallest possible number of bits for a state register representing those states (Note that all the numbers mentioned below are in base 10 and your answer should also be an integer in base 10): a. 11 -> b. 498-> c. 127-> d. 30-> e. 505050-> bits bits bits bits bits

:CLO1.2:Assume having the following value in register A= 0110 1100, Give the logical operations along with the appropriate mask to achieve the following Note: The bits are numbered starting from 0 to 7 from right to left AND, 1000 1000 .A Selectively complements bits number 1st and 3rd bits AND , 0000 1111 .B Clear the higher portion of A v OR, 1000 1000 .C Set the sign bit to 1 v XOR , 0000 1010.D Set the 3rd and 7th bit to 1 OR, 0000 1010 .E OR,1000 0000 .F

Problem_#05] Draw the decoder that generates a logic "O" for each of the input shown below. (a) 1101 (b) 1000 (c) 11011 (d) 11100 (e) 101010 (f) 111110 (g) 000101 (h) 1110110

need help