A binary string is a string where each character is either a ’0′ or a ’1′. How many binary strings are there of length $100,000$ that contain none of $\{001, 100, 1110, 1010\}$ as a substring?