Using http://automatonsimulator.com/ to create: Question 2 and 3 only

Question 2 and 3 only, thanks in advance.

Machines From Backus-Naur Here is the Backus-Naur form that describes the syntax of expressions in post-fix notation : := I : := | Caddoperator> : := +|- mulOperator>:-*1/ ::- | identifier> : :=wlxlyiz 1. For each of these strings, determine if it can be generated by the grammar above. If so, show the derivation of the string. If not, explain why not. For this part, you can do the derivation on paper and put a picture of it in your document. (a) xyz#4 (b) xy-z* (c) wyz-* (d) xy++ e) wxyz- 2. Create a deterministic finite state machine without output that recognizes this language. Test your machine with the strings above. Give me a single screenshot that shows the machine, the test text boxes, and the test results 3. Create a non-deterministic finite state machine that recognizes this language. Test your machine with the strings above. Give me a single screenshot that shows the machine, the test text boxes, and the test results Machines From Backus-Naur Here is the Backus-Naur form that describes the syntax of expressions in post-fix notation : := I : := | Caddoperator> : := +|- mulOperator>:-*1/ ::- | identifier> : :=wlxlyiz 1. For each of these strings, determine if it can be generated by the grammar above. If so, show the derivation of the string. If not, explain why not. For this part, you can do the derivation on paper and put a picture of it in your document. (a) xyz#4 (b) xy-z* (c) wyz-* (d) xy++ e) wxyz- 2. Create a deterministic finite state machine without output that recognizes this language. Test your machine with the strings above. Give me a single screenshot that shows the machine, the test text boxes, and the test results 3. Create a non-deterministic finite state machine that recognizes this language. Test your machine with the strings above. Give me a single screenshot that shows the machine, the test text boxes, and the test results