Assume the following method has been defined: public static int mystery(string a[], int x) { int c = 0; for (int i = 0; i < a. length; i++) { if (a[i].length() > x) c++; } return c; } what is output by the following code? string b [] = {"aardvark", "banana", "cougar", "daikon", "elephant", "fog", "get"}; system. out. println(mystery(b, 5)); 1. 4 2. 5 3. 2 4. 3 5. 0

In any one-minute interval, the number of requests for a popular web page is a poisson random variable with expected value 240 requests. (a) a web server has a capacity of requests per minute. if the number of requests in a one-minute interval is greater than the server is overloaded. use the central limit theorem to estimate the smallest value of for which the probability of overload is less than 0.035. note that your answer must be an integer. also, since this is a discrete random variable, don't forget to use "continuity correction". = 268 (b) now assume that the server's capacity in any one-second interval is ⌊/60⌋, where ⌊⌋ is the largest integer ≤ (this is called the floor function.) for the value of derived in part (a), what is the probability of overload in a one-second interval? this time, don't approximate via the clt, but compute the probability exactly.