Problem \#4: Consider following transition tables draw state diagrams: i. Compute Null Closure for all states. ii. Trace all computations of the string bbaaabaa using extended transition function. iii. Is bbaaabaa in the above language? Problem \#5: Consider following transition tables draw state diagrams: i. Construct the state diagram of a DFA equivalent to NFA of the above problem, using subset construction algorithm. Give all steps. ii. Trace the string aaabb using extended transition function for DFA constructed in (i) Problem \#6: Consider following transition tables draw state diagrams: i. Construct the state diagram of a DFA equivalent to NFA with Null transition of the above problem, using subset construction algorithm. Give all steps. ii. Trace the string bbaaabaa using extended transition function for DFA constructed in (i)