Please, I need help with the following Software Testing question (BOR-MI-CSET.....TBOR-MI ):

Use the BOR-MI-CSET procedure to derive the constraint set and the test set T_bor-mi for the following predicate pr: ab[c + !cd] where a, b, c, d are Boolean variables. Show all the steps in generating T_bor-mi. Draw the abstract syntax tree [AST) and label the nodes N1 to Nm [for the BOR part of the problem). Explicitly list the true and false constraint sets for each node in the AST for the BOR part of the problem. Remember to generate a test set T_bor-mi corresponding to the root node in the AST. Use the BOR-MI-CSET procedure to derive the constraint set and the test set T_bor-mi for the following predicate pr: ab[c + !cd] where a, b, c, d are Boolean variables. Show all the steps in generating T_bor-mi. Draw the abstract syntax tree [AST) and label the nodes N1 to Nm [for the BOR part of the problem). Explicitly list the true and false constraint sets for each node in the AST for the BOR part of the problem. Remember to generate a test set T_bor-mi corresponding to the root node in the AST