The Erlang B blocking formula has been in use since 1917 to design telecommunications systems and is still used, e.g., in cellular and optical networks. It is a formula for the blocking probability that describes the probability of call losses for a group of identical parallel resources (telephone lines, circuits, traffic channels, or equivalent), sometimes referred to as an M/M/K/K queue. The formula applies under the condition that an unsuccessful call, because the line is busy, is not queued or retried, but instead really vanishes forever. It is assumed that call attempts arrive following a Poisson process with rate , so call arrival instants are independent. Further, it is assumed that the message lengths (holding times) with rate are exponentially distributed (Markovian system), although the formula turns out to apply under general holding time distributions. The Erlang B formula calculates the blocking probability of a buffer-less loss system, when a new request arrives at a time where all available servers are currently busy. The formula also assumes that blocked traffic is cleared and does not return. For this study at least 10000 blocking events must be observed to obtain appropriate confidence in each simulated measurement. The call arrival process to the primary system is assumed to be Poisson with rate calls/unit time. Theoretical prediction of the blocking probability from the Erlang B formula. (You can use the on-line Erlang B calculator @ http://www.erlang.com/calculator/index.htm ). Assume the call holding (service) times are exponentially distributed with a mean of one unit time Graph the blocking percentage (probability) for K=8, and different arrival rate l (e.g., 1, 2, ..., 10). The system has no waiting room. i need a c++ code