NFAs can offer exponential saving in space compared with deterministic finite

automata $($DFAs$)"$ justify this statement with suitable example. Construct a NFA and

convert into DFA to accepts the string of a$\text{'}$s and b$\text{'}$s having starting and ending with

same symbol.