Help ASAP compilers

5. Given an NFA N (fO, 1, 2, 3, 4, 5), fa, b), 8, 10). (5)), whose mapping function 8 is shown as the following transition table: (5*5 25 marks) State | Input: a 0+) 1 | Input: b | Input: 4 0 4 5) L (1) Draw the equivalent transition diagram for NFA N; (2) Give a transition process that NFA N accepts string: bbbababba; (3) Construct a DFA that is equivalent to NFA N; (4) Minimize your DFA derived in step (3); (5) Describe the strings accepted by this DFA/NFA in English