(15 points) Create a RIGHT HAND DERIVATION and a PARSE TREE for the following string ( Feel free to stop at the hidi level ): A = (B C) A + C Use the following EBNF:

:--> =

:--> {(+ | -) }

:--> { ( * | / ) }

:--> { ** }

:--> ( ) |

:--> ( A | B | C )