Databases

A freelance computer consultant keeps a database of her clients, which contains the names

S$=\{$Aces$,$ Bakers, Cores, Dion, Effigy, Floyd, Globe, Hilbert$\},$

These clients owe her money:

A $=\{$Aces$,$ Cores, Effigy, Globe$\}.$

These clients have done at least $$2\mathrm{.}000$ worth of business with her:

B $=($Aces$,$ Bakers, Cores, Dion$\}.$

These clients have employed her in the last year:

C $=\{$Aces$,$ Cores, Dion, Effigy, Globe, Hilbert$\}.$

A subset of clients is described that the consultant could find using her database.

The clients who do not owe her money or have employed her in the last year.

Write the subset in terms of A$,$ B$,$ and C$.$

OAUC

OA'nB

OA'uc

O AnB

DAnC

List the clients in that subset.

O $\{$Floyd$,$ Bakers$\}$

O $($Aces$,$ Effigy, Cores, Globe, Bakers, Dion, Floyd, Hilbert$\}$

O $($Aces$,$ Effigy, Cores, Globe$\}$

$\{$Aces$,$ Cores$\}$

x