True or False:

1) DFA and NFA both accept exactly the same set of languages; neither is more powerful than the other.

2) Logic statements are converted to NAND gates for hardware implementation because NAND gates are easy to implement with transistors.

3) AND gates are not converted into NAND because it is impossible to convert an AND gate into a NAND gate, since they are contradictory.

4) Any regular expression of a regular language (i.e., ab*), can be converted to a DFA

Thank you!