Write a program that simulates the CPU scheduling algorithms: Round-Robin (RR) and Shortest Job First (SJF). Based on your testin (80 points) g. analysis the results and explain your understanding. You program should have two ways to get processes' related information: 1) read in an input file where a sequence of process arrival & burst times is stored; 2) let user specify process number (less than 20) and then random generate related arrival & burst times You program should list the scheduling results and compute turnaround times and waiting times for each process. Generate the screenshots for your output and write your analysis about your output