Computer Science - Computer Architecture - Boolean algebra - Simplify Boolean Expressions

P1: 'A AND 1 = ?' → ___ [A (identity)]. P2: 'A OR NOT A = ?' → ___ [1 (complement)]. P3: 'NOT NOT B = ?' → ___ [B (double negation)]. P4: 'A AND (A OR B) = ?' → ___ [A (absorption)]. P5: 'NOT(A AND B) using De Morgan's' → NOT A ___ NOT B [OR]. P6: 'NOT(A OR B) using De Morgan's' → NOT A ___ NOT B [A