Consider the following set of processes, with the length of the cpu burst given in milliseconds: process burst time priorityp1 2 2p2 1 1p3 8 4p4 4 2p5 5 3the 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, nonpreemptive 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?

Write a program that uses a random number generator to generate a two digit positive integer and allows the user to perform one or more of the following operations: a. double the number. b. reverse the digits of the number. c. raise the number to the power of 2, 3, or 4. d. sum the digits of the number. e. if the number is a two-digit number, then raise the first digit to the power of the second digit. f. if the number is a three-digit number and the last digit is less than or equal to 4, then raise the first two digits to the power of the last digit. after performing an operation if the number is less than 10, add 10 to the number. also, after each operation determine if the number is prime. each successive operation should be performed on the number generated by the last operation. your program should not contain any global variables and each of these operations must be implemented by a separate function. also, your program should be menu driven. 7. (fraction calculator) write a program that