Consider a scheduling scenario in which a job of size (processing time) 50ms arrives every 60 ms, and 10 jobs of processing time 1ms arrive every 6 ms. Which algorithm: First Come First Serve, or Shortest Remaining Processing Time, would provide better average turnaround time?