Consider the following set of processes: process burst time arrival time priority start wait finish ta p1 15 4 10 2 p2 5 15 p3 10 20 3 p4 5 25 1 (highest) draw the gnatt chart that illustrates the execution of these processes using the following scheduling algorithms: fcfs, sjf, srtf, non-preemptive priority, preemptive priority, rr (quantum 4) average waiting time: average turn-around time:

Roger ginde is developing a program in supply chain management certification for managers. ginde has listed a number of activities that must be completed before a training program of this nature could be conducted. the activities, immediate predecessors, and times appear in the accompanying table: activity immediate predecessor(s) time (days) a -− 44b -− 55 c -− 11 d b 1010 e a, d 55 f c 55 g e, f 1010 calculate the slack time. show the details.