Build FCFS And SJF algorithms in a program.

For this project, we will reuse the program which we implemented in the project 2. When user starts the program, it will show the prompt after group ID consisting of section # and group # (that is, section#_group#> $). This project aims to simulate two scheduling algorithms of FCFS and SJF, therefore we will choose one of them as an option. tcr –Option –Number of cooked food –Number of dining table The parameters are following. Note that hyphen comes ahead each parameter. Option Number of cooked food Number of dining table fcfs or sjf Any integer Any integer In the option, fcfs stands for FCFS and sjf stands for SJF. In this project, we assume that all guests arrive in the beginning. In other word, all the guests enter the restaurant as soon as chef starts cooking. Time to Cook by chef is one second similar to the project 2, however Time to Eat by guests and Number of Food Guest Wants to Eat must be provided by user. Thus, the program should ask the information first before simulation as shown in the Figure 1. While simulating the restaurant, status of chef, guests, and food should be displayed. After a guest eats all he/she wants, show the waiting time. Chef starts cooking. Guest ID# arrives and wants to eat # of food. Chef cooks one tandoori chicken. [# of cooked food / # of total food available] Guest ID# eats a tandoori chicken. [# of eats / # of chicken he wants to eat] Guest ID# finishes and exits. (after eating all he/she wants) Guest ID# had been waiting for # second(s). All guests finish eating and exit. To exit the program, user needs to enter the following command.