Problem \#7: Consider following transition tables draw state diagrams: i. Trace the string aababba using extended transition function. ii. Construct the state diagram of a DFA equivalent to NFA with Null transition of the above problem, using subset construction algorithm. Give all steps. iii. Trace the string aababba using extended transition function for DFA constructed in (ii)