In order to represent a regular expression, the first step to create the transition diagram is:
(a) Create the NFA using Null moves
(b) Null moves are not acceptable, thus should not be used
(c) Predict the number of states to be used in order to construct the Regular expression
(d) None of the mentioned
This question was addressed to me in class test.
This intriguing question comes from Operators of Regular Expression topic in chapter Regular Expressions and Languages of Automata Theory