Write the two codes in C language only and make different functions assuming mode 1 and mode 2 for different cases. Please answer only when you have strong knowledge of Operating Systems. Wrong answers will be downvoted.

4 Determine the length of the Ready Quene" used in CPU Scheduling of your computer system. Assume that there are the three (3) priority queues for jobs. . The jobs are generated randonly (for all priorities). Define job sizes (say 1, 2, 3, 4) i.e. job size of 3 will consume 3 cpu time units to get served. Input : Number of priority of jobs Ready Queue size : 20,30 tode: output it. Total no. of jobs generated after senidation time of 300 time unts. 21. Total jobs served by CPU. 31. o. of jobs remaining in Ready Queue. 4. No. of jobs lost. sifferent modes: as Whenever a higher priority job arrives in the Ready Queue, a low priority jos in CPU has to be preempted & Ligh priority job allocated. (3) A low priority jos will age (become one priority up) after spending to say, reunits of time ready queue. Mode 2: (a) Here" Ready Queue will act as first care first (b) The jos transfer from the priority queues to ready queue will as per following probability priority s te le serve queue. = Oos 2nd priority 0:3 priority = 0.2 Time units: I loop ( all the functions should be touched)