NOTE: This question is previously asked in Chegg, but the answer is not correct.

In class we described the syntax of regular expressions in an informal manner. You task is to do so using a formal specification method. Specifically, write a BNF (not EBNF!) grammar for regular expressions, as we originally defined them in class-without the various shortcuts. Your start symbol should be . You may assume that symbols and have already been defined with appropriate productions. The former expands to any string containing exactly one character, which must be in the alphabet, and the latter expands to the string consisting of a single lower-case epsilon: "e". Note. When I say "without the various shortcuts I mean that you should not include ".", "+", "?", or the ways of using brackets, like "[^a-zA- Z]. Your grammar should generate a language containing strings like the following. (al2)*c(bb|e) But you should not handle any syntax beyond what is used there. In class we described the syntax of regular expressions in an informal manner. You task is to do so using a formal specification method. Specifically, write a BNF (not EBNF!) grammar for regular expressions, as we originally defined them in class-without the various shortcuts. Your start symbol should be . You may assume that symbols and have already been defined with appropriate productions. The former expands to any string containing exactly one character, which must be in the alphabet, and the latter expands to the string consisting of a single lower-case epsilon: "e". Note. When I say "without the various shortcuts I mean that you should not include ".", "+", "?", or the ways of using brackets, like "[^a-zA- Z]. Your grammar should generate a language containing strings like the following. (al2)*c(bb|e) But you should not handle any syntax beyond what is used there