Q$3.$ a$.$ Define the syntax directed translation scheme for evaluating the Boolean expression. In computer science, a Boolean expression is an expression used in programming languages that produces a Boolean value when evaluated. A Boolean value is either true or false. Assume that the compiler you have designed will accept the Boolean expression may be composed of a combination of the Boolean constants true or false and three Boolean$-$valued operators NOT, AND and OR$.(5$ marks$)$

b$.$ Construct the abstract syntax tree for the following expression $(5$ marks$)$

$($ A && B $)||($ C && $!$D $)$