1. Consider the following sequence of a generic program written in an unknown programming language: case () of 2: ; a,b,c: ; 3..15: ; 12,abc: ; Default ; a. Construct a context-free grammar (in BNF/EBNF format) such that the above sequence of program can be generated as a case statement. b. Construct corresponding syntax graphs such that the above sequence of program can be accepted as a case statement