Build a karnaugh Map for this function table [[A, B, C, D, F b) What is the simplest minimum expression for this function c) Build a circuit using AND, OR, NOT gates to realize this logic

Q2-Using the logic encoding reduce the following logic terms to prove the following: 1- NOT TRUE = FALSE 2- AND TRUE FALSE = FALSE 3- OR FALSE TRUE = TRUE Given AND Function is (x.Ay.x y x) OR Function is (\x . Ay . × x y)

i need the answer quickly