True or False:

If the expected waiting time for an event is finite, then the event will
happen with probability 1.

If the expected waiting time for an event is infinite, then the event will
happen with probability strictly less than 1.

In order to prove a lower bound on the performance of a randomized
algorithm, you need only consider a single randomized adversary.

If X is a given oblivious randomized adversary, then there is a deterministic
algorithm that performs at least as well against X as any randomized
algorithm against X.

There do exist some problems for which the expected peformance of the
best randomized algorithm against the oblivious adversary is ASYMPTOTICALLY
better than the best worst-case performance of any deterministic algorithm.
