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:

Bigmart supermarket has different ways of awarding discounts to its customers for each purchase they make. an 8 percent discount is given on the total value of the purchase. in addition, a standard loyalty discount is given if customers have a permanent customer id card. your program should indicate the amount payable by the customer after the discounts. identify the inputs that the program requires from these options: i. the discount percentage ii. the total value of the purchase iii. the loyalty-discount amount iv. the customer id card number v. the amount payable after discount