Messages are transmitted from the low speed terminals and get there at a message concentrator at a Poisson rate of the 600/hr. They are held in a buffer till a hi-speed trunk line is free to transmit them. The trunk line transmission time is exponential with the mean of 30 secs. Find out the smallest integer number of trunk lines required so that tq the waiting time in the queue satisfies the relation tP[tq< 60 sec.]> 0.95, i.e., the probability exceeds 95% that the time message spends in buffer is less than 60 sec. Calculate L and Lq for the number of trunk lines you determined.