NOTE: PROGRAMMING C PROBLEM

Solutions to the problem should be submitted via D2L. Your solution is to be written in C. 1. A default way in which operating systems schedule jobs to be completed is via Priority. Priority is a number provided by the user that indicates the importance of a job and how quickly it should be executed. The number is often specified in the range of 1 to 10, where 1 is the highest priority. Hint: This is typically implemented using a sorted linked-list data structure. For example Process Arrival ue Mary 10 This would result in: lime Job 10 15 19 IDLE Summary 10 15 19 ue Mary Write a C program that will read in job requests and print out the corresponding job schedule according to a Priority algorithm as above. The input format is each line entry contains a job separated by a tab. The first line of input is ignored as the header. The output format is two tables. First table is the running time and the job currently executing (tab separated). The second table is a summary with the user name (in the order in which jobs arrive) and the time when their last job is completed