in Sebesta's diagram. 2. Using the syntax of C, write a recursive-descent that corresponds to the following EBNF rule: > do ) In this rule, ( and) are not metasymbols. You may assume tharethe lex function reads a single lexeme, whose token code is left in the nextToken variable. Assume that the codes for the do, while, left parenthesis, right parenthesis, and semicolon tokens are DO CODE, WHILE CODE RIGHTPAREN CODE, and SEMICOLON CODE, respectively. Have your function call the error function if it detects an error. LEFTPAREN CODE