Consider a Linux system with multiple users and multiple processes running concurrently. Which of the following statements about process scheduling in Linux is true?

a) Linux uses a priority-based scheduling algorithm, where each process is assigned a priority value based on its resource requirements and past behavior.

b) Linux uses a round-robin scheduling algorithm, where each process is assigned a fixed time slice and is scheduled for execution in a circular order.

c) Linux uses a fair-share scheduling algorithm, where each process is assigned a weight value based on the number of CPU cycles it has used in the past.

d) Linux uses a lottery scheduling algorithm, where each process is assigned a number of lottery tickets based on its resource requirements and past behavior.