Algorithm 6: NFA, to NFA Input: a NFA, M=(2,0, 8,5,F) Output: a NFA M' such that L(M')=L(M) initialize: set 8+ to be 8 repeat if 8+ has a transition p q and a transition q r then add pr to 8+ if 8+ has a transition p 4 and a transition q4r then add pr to 8+ until no change in 8+; let F' be FU{p| there is a 2 transition pf to a state f in F}; let M+ = (2,0,8+,S,F); define 8' to be 8t with all 2 transitions removed ; return M' = (2,0,8',S,F') 116. NFANilGotcha Suppose in Algorithm 6 we replaced the line if 8+ has transition p q and transition q4r, add p4r to 8+ by if 8+ has transition p 4q and transition gr, add pr to 8+ Show by means of a concrete example that that this revised algorithm does not correctly eliminate h-transitions. Try to make your example as small as possible