We want to create a top-down parser which is able to analyze the Java style class declarations same as the following examples, class Car extends Vehicle public class JavalsCrazy implements Factory, Builder, Listener public final class President extends Person implements Official For this, we have the following grammar: Index Grammar Rule C P F class identifier X Y 2 P public 4 Ffinal X extends identifier Y-implements ! 10 1 identifier J 11 J,I 12 E For this homework, you need to submit the followings: a - Compute Nullable values for all nonterminals (LHS) and all production rules (RHS). You submit the Nullable calculation rules and the results. You do not need to submit the iterative table that is used for calculation. (20 points) To refer to productions you use production numbers mentioned above, since using the names are lengthy. The following is an example: Instead of writing "Nullable (extends identifier)" you write "Nullable (6)