My question is:

** (De Morgans law) , De Morgans law can sometimes make it more convinient for us to express a logical ex-pression. These laws state that the ex-pression ! (condition 1 && condition 2) is logically equivalent to the ex-pression (!condition 1 || ! condition 2). Also the ex-pression !(condition 1 && condition 2) is equivalent to the ex-pression (!condition1 && !condition 2).Use De Morgans law to write equivalent ex-pressions for each of the following , and then write a program to show that the orginal ex-pression and the new ex-pression are equivalent in each case:

a) !(x<5) && !(y>=7)

b) !(a==b) || ! (g!=5)

c) !((x<=8) && (y>4))

d) !((i>4)|| (j<=6))

Can anyone post me the answer for this.

it will be real help for me .

thanks.