Determine whether the following statement is true or false, and explain your rea-soning:The set {∧, ∨} is functionally complete.

raw a diagram of a circuit corresponding to the input-output table below.X Y Z output1 1 1 01 1 0 11 0 1 01 0 0 00 1 1 10 1 0 00 0 1 10 0 0 0(B) Determine whether the following statement is true or false, and explain your rea-soning:The set {∧, ∨} is functionally complete.(C) A technical training manual in your workplace contains the following statementEvery compound statement is logically equivalent to one in which theonly symbols used are statement variables, parentheses, ‘↑’ and ‘¬’.A confused co-worker who is not enrolled in our class says “I have no idea whatthat means, or why it may be helpful to know such a thing.” In no more than onepage, write an explanation for your coworker. Include some thoughts on why it isa helpful thing to know.2

1) Generate the truth table for this set of logical expressions.∨ ⊃where indicates ‘or’ operation, • indicates an ‘and’ operation, indicates and ‘if-then’ relationship, and ≡ indicates ‘if and only if’ relationship.∼ ⊃a) ( Y (A • X))

Consider the FOL formula: ((∃y.(P(y))) ∧ (∃y.(Q(y)))) →(∃y.(P(y) ∧ Q(y))). (a) Is this formula valid? (b) Is this formula satisfiable? (c) Is this formula contingent? Justify your answers.

Select all true statements1 pointThere is a TM that loops on all inputsLet A be any decidable language. There is a TM that loops on exactly the strings not in A.Let A be any decidable language. There is a TM that loops on exactly the strings in A.There is an undecidable language A such that there is a TM that halts on exactly the strings in A.There is an undecidable language A such that the complement of A is decidable.There is a decidable language A such that the complement of A is undecidable.

True/False: Java is an example of a functional programming language.Question 5Select one:TrueFalse