Could you please help me to solve question 90 by giving the concrete example? Thank you so much!

42% !! Tue 5:35 PM master.sep-10.pdf (page 102 of 165) Q Sea - For every state fin F, a A transition fSnew -A A transition SnewSM Caution: the old start and accepting states of M are no longer starting or accepting, as states of F. Exercise 90. Suppose suppose in Algorithm 2 we replaced the line if + has transition p q and transition q-a, r, add p-, r to + by if + has transition p . q and transition q- r, add p to + Prove, by showing a counterexample, that this revised algorithm does not correctly eliminate A-transitions. Exercise 91. Practice eliminating transitions Write down some simple NFAs. Combine some pairs of them using the technique in Algorithm 3, resulting in an NFA. Now eliminate the transitions using Algorithm 2. Do the same for concatenation and for Kleene-star. 102 MacBook Air