​​​​After I got the questions in your link and chat minutes before. I attached this questions to get solution. Please make it clear and earlier. ​​1.Perform the Round-Robin dispatch algorithm, with time quantum equal to 300 milliseconds, on the job queue and calculate: Job 1 arrives at time 0 and needs 500 milliseconds to complete. Job 2 arrives at time 300 milliseconds and needs 400 milliseconds to complete. Job 3 arrives at time 400 milliseconds and needs 200 milliseconds to complete. Job 4 arrives at time 400 milliseconds and needs 500 milliseconds to complete. ​​a.The average wait time. (Hint: average the number milliseconds each job was in a wait state) ​​b.Average turn-around-time. (Hint: for each job, count the number of milliseconds from arrival to completion and average) ​​2.How many 512 byte blocks are required to store a 1.6MB file? ​I need the solution for the 2 questions. please make it clear. ​