Hope someone could help me to solve these problems ( please show the explanation)

1) 10101100 BITWISE-AND 00101000 12) 01101011 BITWISE-OR 11010001 You are only given operations of the follow ing four patterns: . SHIFT.. BY BITS TO THE LEFT PRODUCING.. 2. SHIFT..BY ....BITS TO THE RIGHT PRODUCING... 3. BITWISE-AND... WITH... PRODUCING... 4. BITWISE-OR WITH... PRODUCING For example, to solve a particular problem you might say: SHIFT 10100111 BY 4 BITS TO THE LEFT PRODUCINGX SHIFT 00110101 BY 2 BITS TO THE RIGHT PRODUCING Y BITWISE-AND X WITH Y PRODUCING Z BITWISE-OR Z WITH 01010101 PRODUCING THE ANSWER 14) Provide a sequence of operations that will extract the highest 4 bits from the bit-string 11011001., that is, the result of the operations will be 00001101. The result should be stored in 8-bits. (3 points) 15) Provide a sequence of operations that will take the lowest 3 bits of the bit-string 11001110 and the lowest 3 bits of the bit-string 00111111 and concatenate them together, to produce 00110111. The result should be stored in 8-bits. (3 points)