Given the following grammar:
<exp> ::= <exp> + <exp> | <exp> * <exp> | ( <exp> ) | a | b | c
Construct a parse tree for each of these strings:
a + b
a * b + c