Question

The question of validity is to answer the question of whether for a Boolean expression consisting of n variables . There is a combination of values of variables that make the result of the expression true or not. In this phrase each The variable can be simple or contradictory. Force brute method of all compounds . Creates and evaluates the possible and the first time the result is true (if it is) the answer to the problem Come and stop the operation. If all cases are checked and the expression is not true with any combination, the answer: (The question is negative). Implement the validity problem for the force brute method. Note the number of variables . It is not clear and will be entered into the routine as an argument. If the number of variables was constant, you could use Multiple overlapping loops do the job simply, but this is not the case and generally use multiple loops Interference will not be acceptable. You must provide two versions of the software, one recursive and the other non-recurring .

Recursive and both must be force brute and both must work properly.

(It is better for your program to read the input from a file whose address is given as input or specified in the program. This file contains a number of Boolean expressions, each written in a separate line. You can also use common symbols for operators (for and from *, for or from +, for not from~, And for parentheses from parentheses). If you have already written the program and specified the Boolean phrase in the program (as a string or any other form), please explain in full in your description file and specify how the phrase can be changed (Write a program in one of the programming languages such as c or c ++ or Java or any other language you know and send all the files related to the program along with a description file (on how to run the program). Your program should receive a Boolean expression (such as A or B) as input and report on the output whether there is a combination of variable values that make the expression true. For example, the answer is "yes" because if A or B or both are true, the result of evaluating the Boolean expression is true

 thank you