Consider the language defined by the following BNF grammar. Describe in plain English what its sentences consist of. Write the equivalent EBNF. Write a regular expression that will match such sentences. (3 marks) -> b | b a | a c | c (b) The syntax of the standard format specifier in Python is defined by the following EBNF. Write accordingly a regular expression that will match any valid format string, such as '