89.Subsets with Bold Elements

Erica intends to construct a subset $T$ of $S = \{I, J, K, L, M, N\}$, but if she is unsure about including an element $x$ of $S$ in $T$, she will write $x$ in bold and include it in $T$. For example, $\{I, \mathbf{J}\}$, $\{J, K, \mathbf{L}\}$, and $\{I, J, M, N\}$ are valid examples of $T$, while $\{I, J, \mathbf{J}, K\}$ is not. Find the total number of such sets $T$ that Erica can construct.