Solving a boolean equation with a recursive function

Question

I\'m trying to code a function that takes a boolean equation as its input, and gives the answer of the equation as its output. For example:

Input: T &