Steps to creating an NFA from a regular expression

Question

I\'m having issues \'describing each step\' when creating an NFA from a regular expression. The question is as follows:

Convert the following regular expression to a

Answer 1

In the GitHub repository below, you can find a Java implementation of Thompson's construction where first an NFA is being created from the regex and then an input string is being matched against that NFA:

https://github.com/meghdadFar/regex