A single-lane bridge connects the two Vermont villages of North Tunbridge and South Tunbridge. Farmers in the two villages use this bridge to deliver their produce to the neighboring town. The bridge can become deadlocked if a northbound and a southbound farmer get on the bridge at the same time. (Vermont farmers are stubborn and are unable to back up.) "Implement a solution using Pthreads" that synchronizes the threads access to the output screen and prevents deadlock. In particular, represent northbound and southbound farmers as separate threads (use several threads representing the northbound and southbound farmers). Once a farmer is on the bridge the associated thread will:

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.