PLEASE ANSWER ALL QUESTIONS! 1,2,2.1,2.2&2.3

1. Let = { 0,1 } and let L = 010 2 , assuming you already have a function, nextchar(), Write a function nextToken (), which will accept the above language 2. Given the following Finite automata: o, 1 2.1 Write a regular grammar that generate the language accepted by the above Finite Automata. 2.2 What regular expression does it accept? 2.3 Give an example of a parse tree