::If anyone interested in doing the question, kindly can leave your email in the comment section so that I can send the Job List. Thank You in advance ^^

1. Introduction MillionWeb is a software company and its core business is to fine tuning operating system software (OS) according to customer needs and requirements. Lately, MillionWeb receives a contract to update their os's process scheduler according to the list of jobs supplied by MillionWeb 'sclient. These jobs consist of a mixture of CPU-and I/O-bound jobs. MillionWeb needs to evaluate the job lists supplied by the client and propose the best process scheduling algorithm that best suit the job lists. After initial finding, the company found that Round Robin (RR) is one of the best algorithms. Your tasks are to: (a) Implement a C/C++ program to help MillionWeb to evaluate Round Robin scheduling algorithms and propose the most suitable quantum time for the job lists supplied by the client. The job list for your group is allocated separately in an excel file based on your group number. Use only a job list assigned for your group. Each group will get a different job list. To propose the most suitable quantum time for the job lists, following quantum time range is assumed where 1 quantum time equivalent to 1 CPU cycle. Quantum time = [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60] The evaluation of the most suitable quantum time needs to consider the following performance metrics, but not limited to: (i) Turnaround time of the jobs; (ii) Waiting time of the jobs; and (ii) Number of interrupts incurred (b) Prepare a 10-minutes presentation video with C/C++ program execution and PowerPoint slides that reports on the calculation and comparison of performance metrics as stated in (i) (iii), and then recommend the most suitable quantum time for the supplied job lists. (c) Suitable charts should be used to explain and justify your recommendation. Assumptions (a) All the arrived jobs are at "Ready State and ready to be processed by CPU. (b) Only ONE (1) CPU available for processing the jobs. (c) Each context switching incurs ONE CPU cycle. (d) Memory is always sufficient to hold any jobs. (e) Each job has mixture of CPU and I/O instructions, and the integer between the brackets indicates CPU cycle required for each instruction (Please refer to the job list assigned). Example: CPU (20) The integer 20 represents the computational instruction requires 20 CPU cycle to compute. 1/0 (40) The integer 40 represents the I/O instruction requires 40 CPU cycle to complete