(Solved): Consider the following Logic statement: \( \mathrm{X}=1 \) if ((A is 1 NAND \( C \) is 1\( ) \) ...

Consider the following Logic statement: \( \mathrm{X}=1 \) if ((A is 1 NAND \( C \) is 1\( ) \) NOR \( A \) is NOT 1\( ) \) OR (B is 1 AND C is NOT 1) a. Draw a logic circuit that represents the given logic statement. Your logic gates must have maximum of two inputs. Do not simply the logic statement. b. Complete the truth table for the given logic statement QUESTION 2 20 MARKS Artificial intelligence has been with us for some decades now considering auto-pilot fighter jets which have been programmed into auto-guided sorties to carry out bombings in enemy territory. Many examples exist of the growing influence of \( \mathrm{Al} \) in among others, motor car assembly plants where robots are used in an assembly line each to fit a specific part into the car until all the parts are fitted at the end of the line. Today, we have digital assistants on what we now aptly call smartphones which respond to voice commands and/or prompts and then specifically and generally correctly execute the given command. Further to that, self-driving cars are fast becoming a reality in our age having already been successfully tested in Europe and Asia and America. a. Write and evaluative on how you generally perceive Artificial Intelligence in its maturity will affect people's everyday lives and world economies alike. b. Give practical examples in the scenarios you will present bearing in mind that Artificial Intelligence is more a reality now than just a figment of intelligent imaginations. [20] QUESTION 3 15 MARKS Let \( P(x) \) be the statement " \( X \) knows Boxing" and Let \( Q(x) \) be the statement " \( X \) knows Wrestling" where the domain consists of all adults in your household. Write the following sentences using predicates and quantifiers. (a) Every adult in the household knows Boxing or Wrestling. (b) No adult in your household knows Boxing or Wrestling. Using truth tables, 3.1 Show that \( p \leftrightarrow q \) and \( (p \wedge q) \vee(\neg p \wedge \neg q) \) are logically equivalent. 3.2 Show that \( (p \wedge q) \rightarrow r \) and \( (p \rightarrow r) \wedge(q \rightarrow r) \) are NOT logically equivalent. 3.3 Show that \( (P \vee Q) \Rightarrow \neg R) \) are logically equivalent. [15] Consider the following tree below 4.1 What path would BREADTH-FIRST graph search return? The order should be PRE-Order Traversal. 4.2 What path would DEPTH-FIRST graph search return? The order should be POST-Order Traversal. In Philosophy and Artificial Intelligence, there are TWO different types of arguments: Deductive, and inductive. With the statement given below Can Computers Become Conscious and Overcome Humans?" Justify your answer, giving experiments, challenges and Test(s) done to prove this proposition [20]