Please draw Non Finite State Machine(NFSM) or NFSA using Thompson method for RE below

R1. ::= %% R2. ::= | R3. ::= | R4. ::= function [ ] R5. ::= | R6. ::= | , R7. ::= : R8. ::= int | boolean | real R9. ::= { < Statement List> } R10. ::= | R11. := ; | ; R12. ::= R13. ::= | , R14. ::= | R15. ::= | | | | | | R16. ::= { } R17. ::= = ; R18. ::= if ( ) endif | if ( ) else endif R19. ::= return ; | return ; R20. ::= put ( ); R21. ::= get ( ); R22. ::= while ( ) R23. ::= R24. ::= == | ^= | > | < | => | =< R25. ::= + | - | R26. ::= * | / | R27. ::= - | R28. ::= | | ( ) | ( ) | | true | false R29. ::=