I have a question regarding traversing a parse tree given the grammar rules and a sample input. How would the post order traversal tree look for the sample input? Please give a picture representation of the tree if you can, thanks!

Sample input: print 3;

Instructions for traversing:

The print out after the traversal is supposed to be "LLNuNuN"

The nine grammar rules are below Prog StmtList StmtList ::3( Stmt T. SC } { StmtList) Stmt Dec Set| Print Decl := TINT T_ID I T-STRING TID Set ::= T. SET TID Expr Print T_PRINT Expr | T_PRINTLN Expr Expr ::= Term { (T-PLUSIT-MINUS) Expr) Term ::= Primary { (T-START-SLASH) Term } Primary::-T-ICONSTI T-SCONSTI TID IT LPAREN Expr T RPAREN The nine grammar rules are below Prog StmtList StmtList ::3( Stmt T. SC } { StmtList) Stmt Dec Set| Print Decl := TINT T_ID I T-STRING TID Set ::= T. SET TID Expr Print T_PRINT Expr | T_PRINTLN Expr Expr ::= Term { (T-PLUSIT-MINUS) Expr) Term ::= Primary { (T-START-SLASH) Term } Primary::-T-ICONSTI T-SCONSTI TID IT LPAREN Expr T RPAREN