a) Define Regular Expression. b) What is the difference between the strings and the words of a language? c) Convert the regular expression (0+1)01 to an NFA. d) Convert the following NFA to a DFA and informally describe the language it accepts. p * 11 {q, s}: {9} {r} 1 {q, r} {p} {p}