Which operation allows us to find tuples that are in one relation but are not…

To find tuples that are in one relation but not in another, we need an operation that returns elements exclusive to the first relation. Let’s analyze each operation: Cartesian Product: Combines every tuple from the first relation with every tuple from the second. It produces all possible pairs, not tuples exclusive to one relation. Union: Combines all tuples from both relations, removing duplicates. It includes tuples from both, not just those in one. Set Difference: Returns tuples that are in the first relation but not in the second. This operation specifically identifies tuples exclusive to one relation. Set Intersection: Returns only tuples common to both relations. It does not identify tuples exclusive to one. Therefore, the correct operation is Set Difference.