Can help me with the second question?

1. The LCN Least Completed Next algorithm always selects the process which has thus far used the least amount of cpu time. If two processes have the same amount of cpu consumption, processes which haven't been serviced for the longest period of time is selected. Assume that the algorithm reviews processes every second, and that each time slice is 1 second in duration. Show how this scheduling will work given the following set of processes with execution time requirements in seconds and arrival time in seconds from the beginning of scheduling at time 0. (15 points) Process CPU Time needed in seconds 4 Arrival Time at secon