Implement Algorithm 5.6.3 from Sudkamp to convert an NFA-lambda M = (Q, Sigma, delta, q0, F) into a DFA M' = DM.

The input specifies M, and your algorithm should construct the input transition function t (table) for M.

As output you should produce the t-table of M, and all elements specifying M' = (Q', Sigma, delta', q0', F'). You may develop your own notation, e.g., to represent the states of the DFA.

Your program should be general, i.e., it reads the specification of M from a file.

Run your conversion program and generate the outputs.