At HiQ we like to build stable systems, and this requires perfect logic. Are you able to fill in the logic table for us? You need to figure out what the logical statement results to for the different combinations of True and False. The logic statement is as follows:
| A | B | C | (A ∧ B) ∨ (¬A ∧ C) |
|---|---|---|---|
| True | True | True | |
| True | True | False | |
| True | False | True | |
| True | False | False | |
| False | True | True | |
| False | True | False | |
| False | False | True | |
| False | False | False |