As an example of the single-server model with the finite queue, consider the motor shop service station for customers with a free service warranty. If the motorcycle was bought in less than a year, they are entitled to free service for change oil and/or tune-up. The facility has one station in the service facility and 5 motorcycles waited for their turn. If the waiting line is full, the owners of the motorcycle must look for another service station.

1. Determine the probability that there are 6 motorcycles in the system, it is full, and the customer must look for another motor shop.
2. Determine the average number of motorcycles in the system.
3. Determine the average waiting time of motorcycles in the system.