Write a program that takes an infix expression and creates an expression tree. The expression can be numeric or algebraic and may or may not be parenthesized. Use template classes to ensure that both numeric and character values can be handled by the expression tree. Your program should also have four functions that handle the four tree traversals. Your program should output the four expression tree traversals. Lastly use any of these traversals to evaluate the expression and produce a result. Marks will be awarded on the last part depending on your choice of traversal used to evaluate the expression, choose carefully.