In Round Robin scheduling implementation, which data structure should you use to keep track of ready processes? What would the runtime complexity be?

I need the answer with a clear explaination please.

7) (20 points)Assuming the following processes are in the ready queue, calculate the average wait time and average turnaround time for Round Robin scheduling with a time slice of 10ms. Process Arrival Time Burstime (ms) 128 PO P1 P2 P3 57 23