with some clear expination

Q1. State True or False a) The binary expression that directly corresponds to a two level AND-OR circuit will be in SoP form. b) A variable appears uncomplemented in both minterm and maxterm representations if the corresponding bit in its binary representation is 0. c) Each maxterm in Canonical (Standard) form of representation contains every input variable in true or complement form d) Don't care terms can be included or excluded while simplifying logic expressions e) Each term in Sum of Products (SoP) expression is restricted to include only complemented variables f Duality theorem is still valid after SoP to PoS or PoS to SoP conversion. g) There can be only one Essential Prime Implicant in the minimized logic expression for any logic circuit. h) The minimized Boolean expression obtained from Quine McCluskey method must include every variable in its true or complement form i) For a function of three input variables, X,Y, and Z, the maxterm corresponding to 101 is XY'Z. ) The final expression obtained using Quine-McCluskey approach is guaranteed to have fewer literals than the corresponding minimized expression obtained using K-Maps