(2 points) Consider all length 7 binary strings. Let A; be the collection of all such strings in which the length 3 substring 011 occurs starting at position i. There will be non-empty A;. If A; is not empty, then |A, | will be There will be non-empty A, n A, withi # j. If A; n A; is not empty and i # j, IA, n A; | will be There will be non-empty A; n A, n Ax with i, j, k distinct. If A; n A; n Ax is not empty and i, j, k are distinct, |A; n A, n Ax | will be If all triple intersections are empty, answer 0. There are binary strings of length 7 contain the substring 011