Challenge

Using Python, implement a recursive algorithm to evaluate any algebraic

expression. The algebraic expression would be input as an immutable string and

the output of your algorithm should also be an immutable string. Please

implement any data structures that would make the process of evaluating

expressions more efficient.

An algebraic expression would have the following:

Operators

Addition: $+$

Subtraction: $-$

Multiplication: $*$

Division: $/$

Grouping: $()$

Operands

Numerals: $32\mathrm{.}436,18\mathrm{.}7,42$

The following would be valid expressions and their corresponding

evaluations:

$3+12**\frac{3}{12}$

$=>6$

$(3+3)**\frac{42}{6+12}$

$=>14$

The following would not be valid expressions:

$4(12$E$)$

$=>$ Invalid Expression

$4(41)$

$=>$ Invalid Expression

$42+{43}^{****}271$

$=>$ Invalid Expression