Question 5 For each state dizeram below, write the regolar expression for the language. o, b 4(b) 4a) Question 6 Given the state diagram below, angwer the questions, 8108 0 What is the regular grammar of the above automaton! Give a regular expression of the FA above. Question 7 Let M be the NFA automaton as given below.|| 8: Q . a) Construct the transition table of M b) Trace computations of the string bbaba in M