Write a program in a high-level programming language such asC++, Java, or C# that simulates Earliest Deadline First (EDF)algorithm. The code should work with any set of numbers butspecifically the one below.
| Job | A | B | C | D | E | F |
| Arrival Time | 0 | 1 | 2 | 3 | 3 | 5 |
| Execution Time | 3 | 1 | 5 | 2 | 2 | 5 |
| Deadline | 6 | 2 | 10 | 8 | 8 | 15 |
The program should accept any number of jobs (from the user),their (jobs’) arrival times, their execution times, and theirdeadlines. Then the program should produce the timelines ofprocessing of each job (i.e., the timelines that each job isassigned (may be reassigned) to the CPU). The program should alsogive the exact time at which each job is completed. The algorithmshould also calculate the average turnaround time. If there is atie between two or more jobs (if they have the same deadline, etc.)then the program should use a policy to select them in some orderto break the tie: explain the policy that you have used to handlethese situations.
Expert Answer
Answer to Write a program in a high-level programming language such as C++, Java, or C# that simulates Earliest Deadline First (ED…