Let \( U=\{d, f, g, h, k, m, n\} \), and \( A=\{d, k\} \). Determine if the statement below is true or false. \( A \subset U \) Choose the correct answer below. A. The statement is true because every element of set \( A \) is contained in \( U \) and \( A \neq U \). B. The statement is true because every element of set \( A \) is contained in \( U \) and \( A=U \). C. The statement is false because not every element of set \( A \) is contained in \( U \). The statement is false because every element of set \( A \) is contained in \( U \) but \( A \neq U \).

A. The statement is true because every element of set \( A \) is contained in \( U \) and \( A \neq U \). Every element in set \( A \) (which contains \( d \) and \( k \)) is indeed found in \( U \), which includes all elements of both sets. Thus, \( A \) is a subset of \( U \), confirming that the statement is true since \( A \) does not equal \( U \). As for a common mistake, it's easy to assume that two sets are the same just because they share some elements. Remember, a subset simply needs to hold some (or all) of its elements in the larger set without requiring equality!