c++ program tha simulates the service of jobs(programs) by the CPU of a multi-user computer

PROJECT SPECIFICATIONS: In this project, you will write a program that simulates the service of jobs (programs) by the CPU of a multi-user computer. Before starting to write this program, you should review the discussion of time-driven simulations in the case study provided by the instructor. The program that you are writing is somewhat different, but you may be able to steal some of the design and code from that program. The job class and CPU time required for each job is determined using random number generator. Processing This is a clock-driven simulation, in which the clock is a counter that is incremented each simulated second. The clock is initially 0, and continues "ticking" until all the jobs in the input have been serviced and left the system. Unlike the simulation in the textbook, which ran for a specified number of clock ticks, this simulation runs until a particular number of jobs have been serviced and left the system. This number is input by the user. When a job enters the system, it is enqueued on a wait queue. The CPU's "queue" represents the jobs that are currently being serviced. If there is room in the CPU's queue, a job is dequeued from the wait queue and enqueued onto the CPU queue. Jobs in the CPU queue are serviced using the following scheme: although the CPU actually executes only one job at a time, there can be as many as ten jobs in the CPU queue. To service these jobs, the CPU allocates a "time-slice" to each job in the CPU queue, depending on its class. To the observer, it appears that the CPU services several jobs simultaneously; however, most jobs are interrupted when they require I/O or other services. To avoid idleness while waiting for the required service, the CPU starts working on the next job in the CPU queue. We simulate this by having each job fall into one of two job classes: I/O bound and CPU bound. I/O-bound jobs have a time-slice of 0.1 seconds, while CPU-bound jobs have a time-slice of 0.2 seconds. The job at the front of the CPU queue executes for its required time-slice; then it is dequeued and enqueued at the rear of the CPU queue. Jobs remain in the CPU queue until they complete their service time. Note that jobs may leave the CPU at non-integral times. I need it to be done within 5 hours