1a.Suppose P is a false statement. Is it ever possible for P ⇒ Q to be false? Explain your answer. 1B.Suppose P is a true statement and that (P ∧ Q) ∨ ¬P is false. What is the “truth value” of Q? (No work need be included with this question).  1C.Write down a non-statement, and explain why it is not a statement.

Can someone help me solve this problems(Q1-Q6)? Mathematical Foundations of Computing Problems 1. Write each of the following conditional statements and the corresponding converse, inverse, and contrapositive as English sentences in the form “if ?, then ?.”Example: Whenever it rains, it pours.Answer:Original statement: If it rains, then it pours.Converse: If it pours, then it rains.Inverse: If it doesn’t rain, then it doesn’t pour.Contrapositive: If it doesn’t pour, then it doesn’t rain.1.1 You can do it if you put your mind to it.1.2 Being cold implies that you need a jacket.1.3 Petting the cat is sufficient for it to purr. 2. Determine the truth value of each of the following statements if the domain consists of all integers. If it is true, find a different domain for which it is false. If it is false, find a different domain for which it is true. Justify your answers.Example: ∀?(? ≤ ??)Answer:False. If ? = −1, then 2? = −2 and −1 > −2.True when the domain consists of all…

Answer both please

Discuss the exhaustive proof method. Give an illustrative example.

What do you really imply when you make reference to the "Principle of Non-Repudiation" in your statement?

Please answer the question in the screenshot.

What is the "Principle of Non-Repudiation" according to you?

What is the "Principle of Non-Repudiation" according to you?

Describe the difference between a chained conditional and a nested conditional. Give your own example of each. Do not copy examples from the textbook. Deeply nested conditionals can become difficult to read. Describe a strategy for avoiding nested conditionals. Give your own example of a nested conditional that can be modified to become a single conditional, and show the equivalent single conditional. Do not copy the example from the textbook.     The code and its output must be explained technically whenever asked. The explanation can be provided before or after the code, or in the form of code comments within the code. For any descriptive type question. End your discussion post with one question related to programming fundamentals learned in this unit from which your colleagues can formulate a response or generate further discussion.

Directions: For each proof, you must include (i.e., write) the premises in that proof. I do not want to see any proofs without premises. YOU CANNOT USE CONDITIONAL PROOF (CP), INDIRECT PROOF (IP), and ASSUMED PREMISES (A). Additionally, use only the 18 rules of inference found in the text and in the notes. You will lose points if you use any of the inference rules Resolution, Contradiction, Transposition, Idempotence and Identity.