Consider the following SDT and answer the following questions:

1.Write the given string expression into its equivalent postfix notation using the SDT.

2. How many internal nodes are there in the parse tree of the string?

E E+T { printf("+") } IT {} T>T+F { printf("*") IF {} FT num { printf(num.Ivalue) } String = 2*9+5*6*4+1+7*2*3