1. Given the following regular grammar: SaSalbJ,IbKa,JbKa,Ka one can use the algorithm given in slide 34 of the notes "Regular Languages and Finite Automata- IV" to construct an NFA to recognize the language of that grammar. Fill out blanks in the following figure so that the resulting NFA would fulfill such a task, i.e., would recognize the language of the given grammar. (4 points)