3. 14 marks: correct table rows, correct table headings, correct logic statement] **Determine whether is valid using a truth table. Clearly state your final answer. 4. 12+1+1-4 marks] Given the following expression: E xy(x+y) a) * Draw the circuit that represents this expression as is. b) The expression can be simplified to sum of products using one rule: which rule is it? c) Draw the circuit that represents the simplified expression. 5. [8 marks: 1 mark per correct step, 1 mark per label]Simplify the following statement using the laws and axioms of logic. Clearly state which law or axiom has been used at each step. 6. 11+3 4 marks] For the following statement Vs e cos10003 students, 3m E movies, watched(s, m) a) *Write in English what it means. b) Represent the negation of this statement symbolically showing working (2 marks), and write the English representation (1 mark). 7-14 + 4 #8 marks] Given the following statements: The file is a binary file or a text file. If it is a binary file then my program won't accept a) Convert these statements into propositional logic statements b) * * * without using a truth table, show that this argument is it. My program will accept the file. Therefore the file is a text file (1 mark per statement) valid. This could be done using contradiction or the laws/axioms of algebra (note the latter is a long process though). 3. 14 marks: correct table rows, correct table headings, correct logic statement] **Determine whether is valid using a truth table. Clearly state your final answer. 4. 12+1+1-4 marks] Given the following expression: E xy(x+y) a) * Draw the circuit that represents this expression as is. b) The expression can be simplified to sum of products using one rule: which rule is it? c) Draw the circuit that represents the simplified expression. 5. [8 marks: 1 mark per correct step, 1 mark per label]Simplify the following statement using the laws and axioms of logic. Clearly state which law or axiom has been used at each step. 6. 11+3 4 marks] For the following statement Vs e cos10003 students, 3m E movies, watched(s, m) a) *Write in English what it means. b) Represent the negation of this statement symbolically showing working (2 marks), and write the English representation (1 mark). 7-14 + 4 #8 marks] Given the following statements: The file is a binary file or a text file. If it is a binary file then my program won't accept a) Convert these statements into propositional logic statements b) * * * without using a truth table, show that this argument is it. My program will accept the file. Therefore the file is a text file (1 mark per statement) valid. This could be done using contradiction or the laws/axioms of algebra (note the latter is a long process though)