Computer Science - Computer Architecture - Logic gates - Truth Table Challenge

Complete truth tables. P1: 'AND: inputs 1,0 → output ?' → ___ [0]. P2: 'OR: inputs 0,0 → output ?' → ___ [0]. P3: 'XOR: inputs 1,1 → output ?' → ___ [0]. P4: 'NOT: input 1 → output ?' → ___ [0]. P5: 'NAND: inputs 1,1 → output ?' → ___ [0... wait NAND(1,1)=NOT(AND(1,1))=NOT(1)=0. Actually NAND(1,1)=0