please help with c)

``` ::= def : EOF

::= f | g

::= ( )

::= , |

::=

::= \t

::= |

::= | |

::= =

::= <=

::= if : \t else :

::= return

::= +

::= |

:: = a | b | c

:: = 0 | 1 | 2

represents the new line terminal. \t represents the tab terminal.

(a) Show that the grammar above is LL(1). Use a formal argument based

on the definition of the LL(1) grammar.

(b) Show the LL(1) parse table.

(c) Write a recursive descent parser for the above grammar in pseudo code

in the same format as that in Lecture 7. You may assume that the

next token() function is already implemented for reading the next token in the remaining input string and you can directly use it in your

pseudocode.

```