Consider the following situation - checkout line in a counter. The details are shown as below:
i. One check-out line
ii. The serving time for every customer is one minute but they may have to wait in line before being served
iii. The customers between zero and five will join the line
iv. Simulate the flow of the customers
Write pseudocode that simulates the flow of the customers through the line during a time period n minutes long.
[Hint: You need to use First-In-First-Out queue implementation. If you make any assumption, please justify/describe it].