Chapter $7,$ Problem $7$PP$.$ Provided the question below instead of the link.

In Figure $7\mathrm{.}5$ on page $364$ we presented a

program to evaluate arithmetic expressions.

In this exercise you will write a similar program to evaluate boolean expressions. Rather than

arithmetic operations, the input expressions for this

program will use the operations && $($the $$and$$ operation$),||($the $$or$$ operation$),$ and $!($the $$not$$ operation$).$ Rather than combining numbers, the input

expression will combine simple boolean comparisons of numbers such as $(1<2)$ and $(6<3).$ Assume all the numbers in these simple comparisons

are integers. Allow the following comparison operations: $<,>,<=,>=,==,$ and $!=.$ At first assume that

all boolean expressions are fully parenthesized and

well formed. Be sure to note that $$not$$ is a unary operation. You can assume that the argument to $$not$$

$($which follows the $!)$ is enclosed in parentheses.

Your program should allow the user to evaluate additional expressions until the user says he$/$she wishes to end the program.