Please, can you explain how to solve this question? C program to test expressions for logical equivalence using functional notation.

Also an exercise in coding with expressions vs functions.

a. bool Implication(bool a, bool b); // a -> b

b. bool Bicondition(bool a, bool b); // a <-> b

c. bool Maybe(bool a, bool b); // a ? b

d. bool Because(bool a, bool b); // a @ b

e. bool And(bool a, bool b); // a & b

f. bool Or(bool a, bool b); // a | b

g. bool Xor(bool a, bool b); // a ^ b

h. bool Not(bool a); // !a

3)also, how can i test the following expressions, can you explain for me

a. p | q ~(~p & ~q)

b. p & (q -> r) (p & q) ^ r

c. p <-> q ~(p ^ q)

d. (p <-> q) -> r p & (~q | r)

e. ~(p -> (q & r)) p & ~(q & r)

f. p | (p ? q) p & (p @ q