When a system gets busy, it tends to take longer for a request to be completed. This happens with web servers, bank clerks and many other queuing systems. Write a program to determine how long it will take a server to provide a service based on how busy it is. Assume it takes an exponentially distributed average of s seconds to complete a request when the server is idle and there are no other requests.

COMP163 Queuing Theory Lab When a system gets busy, it tends to take longer for a request to be completed. This happens with web servers, ban long it will take a server to provide a service based on how busy it is. Assume it takes an exponentially distributed average of s seconds to complete a request when the server is idle and there are no other requests. When the server is receiving an average of requests per second, the time to complete a request can be calculated by: k clerks and many other queuing systems. Write a program to determine how Request,Time = Where - * s You can write the program as a command line application for a maximum possible score of 75 points or you can write the program with a Graphical User Interface for a maximum possible score of 100. Write the program as an application or with a GUI. Do not do both. For a maximum of 75 points, you can write the program as a Java application. Example input and output Enter the idle service time Enter the load per time 0.25 Requests will take 12.0 // this represents one request every 4 time periods For a maximum of 100 points, create the program with a Graphical User Interface. You are free to format the GUI in any way that works effectively. An example format is nter server time 0.012 Enter load 55 Calc Requests will take 0.0352941176470588 Upload your Java application or GUI program to Blackboard before the end of your lab period