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