In a uniprocessor system, five processes arrive at different time. The processing time for each process is listed in following Table. Complete the following table for different scheduling policies, namely, First-Come-First Served (FCFS), Round Robin with time quantum of 1 (RR q = 1), Round Robin with time quantum of 3 (RR q = 3), Shortest Process Next (SPN) and Shortest Remaining Time (SRT) in your answer script