my professor's note: Make sure that the examples you give below are as original as possible.

$1-)$ Write $1$ DFA and $1$ NFA example. $($Draw the diagram$)$

For example; Give DFAs that accept the following languages $$over the alphabet $\{0,1\}.$ Strings whose second character from the right end is $1.$

$$

$2-)$ Convert $1$ NFA that you specify to DFA. $($Determine the transformation table and draw the DFA diagram$)$

$$

$3-)$ Convert $1$ NFA that you specify to Regular Expression $($step by step$)$

$$

$4-)$ Minimize $1$ DFA that you specify. $($Draw the transformation $($algorithm$)$ table and draw the Minimized DFA$)$

$$

$5-)$ Convert $1$ CFG that you specify to Chomsky Normal Form.