Consider the following set of processes, with the length of the cpu burst time given in milliseconds: process burst time priority p1 2 2 p2 1 1 p3 8 4 p4 4 2 p5 5 3 the processes are assumed to have arrived in the order p1, p2, p3, p4, p5, all at time 0.

a. draw four gantt charts that illustrate the execution of these processes using the following scheduling algorithms: fcfs, sjf, non preemptive priority (a larger priority number implies a higher priority), and rr (quantum = 2).

b. what is the turnaround time of each process for each of the scheduling algorithms in part a?

c. what is the waiting time of each process for each of these scheduling algorithms?

d. which of the algorithms results in the minimum average waiting time (over all processes)?

Problem 3: (hand) write the member function implementations for the class hand, which simulates a hand of 2 cards, into the file hand.cpp. the relative strength of 2 hands are determined by the following rules: • a pair (two cards of the same number) is the strongest hand. • two cards of the same suit is the next strongest hand. • two cards of different numbers and suits is the weakest hand. • within the same kind of hands, the stronger hand is determined by the larger number. • if two hands are of the same kind and the larger numbers are the same, the stronger hand is given by the hand whose smaller number is larger. • if all above fails, the two hands are of equal strength. i.e., all suits are of equal strength. • 2 is the weakest number. an ace is stronger than a king. you are using a single deck of cards. so a hand of a♥a♥ is impossible. here are some examples: