in C $++$ plz Problem $3-$ Filename: BoolSimplify

Write a program to simplify Boolean expressions. Input from the keyboard a string representing a valid Boolean expression with spaces between the capital letters. Assume proper input. The only valid operators are $[+,*,]$ representing OR$,$ AND, and NOT, and valid input characters are $[$A$,$ B$,+,*,10].$ The expression will contain at most three operands, three operators and one set of parentheses. Use the following list of fundamental Boolean identities for simplification:

Commutative Law

Associative Law

Idempotent Law

$3$

COSC$2425F24$

Annihilator Law

Identity Law

Complement Law

Absorptive Law

DeMorgan's Law

Double Negation

Output to the screen the simplified equivalent of the given expression. Simplify means outputting the fewest operators with no parentheses. Finally, the program should ask if the user wants to run the program again $($Check case$).$ Refer to the sample output below.

Sample Run:

Expression: $($A $+$ B$)$

Simplified: A $*$ B

Run again $(\frac{Y}{N}$ : Y

Expression: A $*$ A $+1$

Simplified: $1$

Run again $(\frac{Y}{N}$ : y

Expression: $0+$ A $*$ B

Simplified: A $*$ B

Run again $($Y$/$N$)$: nIn