1. (40 Points) Let B = bib2 ... by be a bit string of length n. Consider the following problem: determine whether or not B contains 3 consecutive I's, i.e. whether or not B contains the substring "111". Consider algorithms that solve this problem whose only allowable operation is to peek at a bit. a. (20 Points) Suppose n = 4. Obviously 4 peeks are sufficient. Give an adversary argument showing that in general, 4 peeks are also necessary