Consider four processes P₁, P₂, P₃, and P₄ arrived at a time 0, 1, 2, 1 with computation time 5, 7, 3 and 1 respectively. In case of the same arrival time, the process with the lowest subscript is given the highest priority if the scheduling algorithm used is FCFS or SJF. Which two scheduling algorithm gives the same average waiting time?

I. Shortest Job First (SJF)

II. Round Robin with time slice value 2

III. Shortest Remaining Time First

IV. First Come First Serve