Question Be concise and complete with all answers and give full paragraph (4-5 sentence) answers each for the discussion questions. Discussion questions: - Boolean algebra and logic gates 1) Of AND, OR and NOT, the three basic Boolean operators, which one can be replaced by the other two. Show how that is done. 2) Consider the types of logic gates available - which three of those are critical ones? In other words, which three can be combined to make up any of the others? 3) Explain the difference between OR and XOR. Problem solving: - logic gates and machine code 1) Let's define an "XAND" gate as a digital logic gate that is true if both values are the same. Implement it using AND, OR and NOT logic gates. If it is easier for you to think of this in Boolean algebra, then create the Boolean expression first and then generate the logic gate diagram. (note that XAND was created by Prof and doesn't exist. You won't find it online.) I 2) Given the following memory dump, using the machine code we introduced in class and with the program counter pointing at memory 6, which is where your code starts (remember memory starts at 0 but may include data), what value will accumulator (RO) hold after the code below executes (show work). Memory dump follows. (in hex...convert to binary). Remember that memory is addressed at the byte level so after each 8 bits (hex pairs) you increment address (i.e., the memory dump below runs from address 0 to address 27) 00 00 00 32 00 19 41 00 64 46 00 02 76 00 04 56 00 02 DA 00 02 81 00 01 39 00 09 10 Lab work: In lab we filled in most of the microcode interpreter (Your task is to complete the following functionality) 1) Finish implementing the getAddr function (.e., case '10'). 2) Implement the setAddr function (i.e., case '00' & '10'). 3) Implement the following 3 instructions: STO, CPL, and AND Run Execution: Registered Instruction Step RO: Program Counter: RI: R2: Memory (binary): Memory (hex): to Hex->