Question $68(1$ point$)$

$A(n)$

constraint is a type of constraint that addresses whether an instance of

a supertype must also be an instance of at least one subtype.

A$)$ disjoint

B$)$ weak

C$)$ overlap

D$)$ completeness