2. To transform the following NFA into a regular grammar, b a we first construct A-closures of the given NFS's states A(0) 10, 1, 3), A(1) {1, 3), A(2) 12), A(3) 313), Then, build the following tree: (7 points) A(0) (0,1,3 Distinct nodes of the tree are: (2 points) (0,1,3)