De Morgan's Laws describe how mathematical statements and concepts are related

through their opposites. In propositional logic, De Morgan's Laws relate conjunctions and disjunctions of propositions through negation.

The first De Morgan's law is:

$($p $$ q$)($p $$q$)$

The second De Morgan's law is:

$($p $$ q$)($p $$q$)$

Use De Morgan$$s first and second laws to write a program $($Java or C$++$ or any language you wish$)$ to show that both expressions in each case produce the same result.

First Law:

$(($x $<5)($y $>=7))(($x $<5)($y $>=7))$

Second Law:

$(($i $>4)($j $<=6))(($i $>4)($j $<=6))$

Example input $($the program should prompt the user to input the below values$)$:

x : $7$

y : $6$

i : $5$

j : $4$

Corresponding output:

$!($A and B$)=$ true

$!$A or $!$B $=$ true

$!($A or B$)=$ false

$!$A and $!$B $=$ false