Consider the following BNF grammar with as the start symbol: -> begin end -> | -> | | | -> = -> = -> if ( ) -> while ( ) -> byte | int | short -> a b c d -> | 1 | 2 | 3 | 4 | 5 -> + - | -> | -> -> == | != | | = In exercise-1.txt , write the leftmost derivation for the following snippet of code based on the BNF grammar above. Remember to expand only one nonterminal at a time (i.e., each line in the derivation should represent the expansion of a single nonterminal). Also, an expansion should be all in one line. begin int x = 0 short y = 1 if ( x != 3 ) y = y + 2 end