Given the following infix expression: (a – b + c * d) – e * f / (g / h + i). Produce a binary expression tree. Recall that, leaves of the tree are operands, and other internal nodes are the operators.