The customer flow at a grocery store can be viewed as a Poisson process, i.e. P ( The # of customer arrivals in (0,() =k )=e-ar (at)* Suppose the K! probability that in two minutes no customer arrives equals to 0.7. (1) 1 is most nearly (a) 0.6 (b) 0.7 (c) 0.8 (d) 0.5 (2) The probability that in 5 minutes at least one customer arrives is most nearly (a) 0.95 (b) 0.75 (c) 0.85 (d) 0.2 (3) The probability that in one minute exactly two customers arrive is most nearly (a) 0.01 (b) 0.03 (c) 0.1 (d) 0.8 (4) The probability that in 3 minutes no customer arrives is most nearly (a) 0.24 (b) 0.18 (c) 0.72 (d) 0.84