Write the Polish and Reverse Polish Notation and draw the parse tree for the following expressions. Assume normal precedence relationship.

1. a * b +c
2. (a + b) * (c + d)
3. a + b * c + d
4. a + b + c + d
5. a * b + c * d