Solve this task in C$++$ Let a boolean expression have the following form:

t$,$ which is True;

f$,$ which is False;

$!($expr$),$ which is the logical negation of the inner expression expr;

&$($expr$1,$ expr$2,...),$ which is the logical AND of two or more expressions expr$1,$ expr$2,...$;

$|($expr$1,$ expr$2,...),$ which is the logical OR of two or more expressions expr$1,$ expr$2,...$;

A$.(1$ point$)$ Write a function that, given a boolean expression, returns its result. The calculation should only use a stack data structure. You are allowed to use helper functions. Examples:

$!($f$)=>$ true

$|($f$,$t$)=>$ true

&$($t$,$f$)=>$ false

$|($&$($t$,$f$,$t$),!($t$))=>$ false

B$.(0\mathrm{.}5$ points$)$ Given a queue of boolean expressions of the described form, write a function that finds how many of the expressions in the queue evaluate to true. The function should NOT destroy the queue and is NOT allowed to use additional data structures.