I need help with the First Come First Serve approach. (Coding in Java)

These are the general specifications for P1. Start reading immediately, and please rert any error or inconsistency that you may find. Expect additions for further clorifications and corrections in the coming days; so, stay in touch with this online document for the latest version. 1 Introduction Pat & Mat are two friends who try to solve different problems many of which are self-made. You can see them in action here, if you wish. They have recently decided to begin their culinary careers by opening their first restaurant in Mayaguez. It would have a small kitchen that can prepare only one order at a time They expect to have a large number of customers during rush hours. So, they will need to have some approach to pick the next customer to serve among all waiting ones, such that they maximize their profit and/or customer satisfaction There are different parameters that they need to consider when deciding which customer should be served next. Each customer's order requires a specific amount of time to prepare, and will earn a specific profit. For example, one customer's order may require 10 minutes to prepare for a profit of $2.00, while another order may be prepared in 15 minutes for a $3.50 profit. Further, customers will not wait in the linc indefinitely; each customer will leave after some time based on their level of patience. For example, one customer will leave if their order is not picked in 10 minutes, where another customer will wait up to 30 minutes. Pat & Mat invited two friends, Max and Pac, to help them decide how to serve their customers. All four proposed a different serving approach, and they cannot agree unanimously on any 1) Pat suggested serving customers based on their arrival time, ie., selecting the customer who arrives earliest). He argued that this is a fair way of doing it. This approach is usually referred to as 2) Mat thinks that it will be easier to just select the last person who arrives. This approach is usually 3) Max only thinks about money, so he suggested selecting the customer who can bring the highest 4) Pac thinks food should come fast, so he suggested selecting the customer whom can be served in When Pat & Mat failed to decide on the best approach, they decided to get your help. They are asking you In this project (PI), you will design and develop a restaurant simulator to simulate these four different First-Come-First-Served (FCFS) referred to as Last-Come-First-Served (LCFS). profit. This approach is usually referred to as Max-Profit-First (MPF). the shortest time. This approach is usually referred to as Shortest-Job-First (SJF) to write a simulator to see how each approach works in different scenarios. approaches to find out which is the best. Note that there might be multiple strategies that are the best