Let's solve the problem step by step as per your instructions: --- ### **Step 1: Introduction to the Concept** The circuit shown in the image uses relays to represent a logic function. Each relay (A and B) can be either in the ON (1) or OFF (0) state. The switches are connected in parallel, which represents the logical OR operation in Boolean algebra. The output will be ON (1) if at least one of the inputs (A or B) is ON (1). ### **Step 2: Correct Answer and Explanation** #### **Correct Answer: Table C** Let's analyze the circuit: - The two switches A and B are in parallel. - For the output to be ON, **at least one switch must be closed (i.e., A = 1 or B = 1).** - This is the behavior of an **OR gate**. Let's check the truth table for an OR gate: | A | B | Output (F) | |:-:|:-:|:----------:| | 0 | 0 | 0 | | 0 | 1 | 1 | | 1 | 0 | 1 | | 1 | 1 | 1 | Now, compare this to the options: **Table C:** | A | B | F | |:-:|:-:|:-:| | 0 | 0 | 0 | | 0 | 1 | 1 | | 1 | 0 | 1 | | 1 | 1 | 1 | This matches exactly, so **Table C is correct**. --- ### **Step 3: Explanation of Why Other Options Are Incorrect** - **Table A:** | A | B | F | |:-:|:-:|:-:| | 0 | 0 | 1 | | 0 | 1 | 0 | | 1 | 0 | 1 | | 1 | 1 | 0 | - This does not match the OR gate operation. For instance, when A = 0 and B = 0, the output should be 0, not 1. - **Table B:** | A | B | F | |:-:|:-:|:-:| | 0 | 0 | 0 | | 0 | 1 | 0 | | 1 | 0 | 0 | | 1 | 1 | 1 | - This matches an AND gate, not an OR gate. - **Table D:** | A | B | F | |:-:|:-:|:-:| | 0 | 0 | 0 | | 0 | 1 | 1 | | 1 | 0 | 1 | | 1 | 1 | 0 | - This does not match the OR gate operation either. When both inputs are 1, the output should be 1, not 0. --- ### **Final Answer** The correct answer is **(c) Table C**. This table accurately represents the truth table for the logical OR operation as implemented by the relay circuit shown.