Consider a system with three processes P1, P2, and P3, each of which can transition between various states: Ready (R), Running (N), and Block (B). The following diagram represents the state transitions for each process:

P1: R -> N -> B -> R

P2: R -> N -> R -> N P3: R -> N -> B -> R If the system uses a preemptive scheduling algorithm, which process will be in the running state at time t=8?

Options:

A) P1

B) P2

C) P3

D) None of the above