Languages by Type (Chomsky Hierarchy):

For the following languages L, indicate whether L is (a) regular, (b) context-free but not regular, (c) recursive but not context-free, (d) recursively enumerable but not recursive, or (e) not recursively enumerable.

If L is regular, describe a DFA or NFA that accepts only strings w L.

If L is context-free but not regular, describe a deterministic or non-deterministic PDA that accepts only strings w L.

1. L ={aⁱ : i 0}. 2. L ={aⁱbⁱ : i 0}.

Please explain me both