Answer will be (E)
a) True. Every expression can be written in SOP form
b) True. Every expression can be written in POS form
c)True. We can write OR in the form of AND. e.g.(A+B)=not(not(A) . not(B))
d)True.We can write AND in the form of OR e.g. (A .B)=not(not(A) + not(B))
(e)False. We cannot convert NOT gate to any other gate. We cannot also get NAND , NOR such universal gate without NOT gate. So, without NOT gate we cannot get every boolean expression