1. Regular Expression to NFA-  (a+ba) * a

2. First Parsing Step concatenate (a+ba) * a

3. Second Parsing Step concatenate *a a+ba

4. Third Parsing Step concatenate *a + aba

5. Fourth Parsing Step concatenate *a + a ba

6. Identify Leaf Nodes concatenate +a + a ba

7. Convert Leaf Nodes concatenate * + This conversion corresponds to the base case in the transformation algorithm a a a b

8. Identify Convertible Node(s) concatenate * + a a a b Conversion Rule: Concatenation

9. Convert Node concatenate * + a aab Conversion Rule: Concatenation

10. Identify Convertible Node concatenate * + a aab Conversion Rule: Union

11. Convert Node concatenate * a a ab Conversion Rule: Union

12. Identify Convertible Node concatenate * a a ab Conversion Rule: Kleene Closure

13. Convert Node concatenate a Conversion Rule: Kleene Closure a ab

14. Identify Convertible Node concatenate a Conversion Rule: Concatenation a ab

15. Convert Final Node a Conversion Rule: Concatenation a ab