You are given a boolean expression which consists of operators &, | and ‚àß (AND, OR and XOR) and symbols T or F (true or false). You have to find the number of ways in which the symbols can be parenthesized so that the expression evaluates to true. This is the boolean parenthesization problem. Which of the following methods can be used to solve the problem?

• A. Dynamic programming
• B. Recursion
• C. Brute force
• D. All of the mentioned