If set of input symbols contains {0,1} and the given language contains all the strings beginning with 1 and not having two consecutive O's. (a) Build a regular expression satisfying the above mentioned constraints. (b) Also Construct a FA equivalent to regular expression created in step (a). Use the editor to format your