Using the grammar below, draw a parse tree for the following expressions.

a. a * b - 1 + c

b. a * (b - 1) / c mod d

c. (a - b) / c & (d * e / a - 3)

or | xor sexpr or> and -and> = | /= + | & | % term> * | not | ( a | b or | xor sexpr or> and -and> = | /= + | & | % term> * | not | ( a | b