(8 points) Write the parse B() function of a predictive recursive descent parser for the grammar. Print out the production rule after successfully parsing the rule (as in the homework). You can assume that the functions getToken(), ungetToken(), and syntax error() are available. You only need to write the parse function for B and you can assume that the parse functions for the other non-terminals are available.