16.6 Algorithm for learning reversible languages. What is the DFA A returned by the algorithm for learning reversible languages when applied to the sample S =

fab; aaabb; aabbb; aabbbbg? Suppose we add a new string to the sample, say x = abab. How should A be updated to compute the result of the algorithm for S [ fxg? More generally, describe a method for updating the result of the algorithm incrementally.