3. Consider Bob, an absent-minded student. Bob has a set of 5 passwords that he uses for all his login needs. He often forgets which password matches with which system so his strategy is to try all of them. Specifically, from his set of passwords he picks one uniformly at random and enters it. If he succeeds all is well; if he fails he removes the password from the set and repeats the process a. Suppose Bob is currently trying to login into SuperStrictSystem. It has a policy that if a user fails to enter the correct password three consecutive times the user will be permanently locked out of the system. What is the probability that Bob fails to access the system? b. Suppose Bob switches to NotSoStrictSystem. This time around, this system will not limit the number of times a user tries to log in. Instead, if a user fails to enter the correct password for k consecutive times, it Will delay its response by 2K seconds. For example, if Bob gets the password right the first time, the delay is just 1 second, etc