Is the following statement correct?Statement: Thompson construction is used to convert Regular expression to finite automata.

• A. Yes
• B. No