In the DPLL algorithm for propositional satisfiability, Unit Propagation is recursively applied to simplify clauses. Consider the CNF formula: $\phi = (\neg P \lor Q) \land (\neg Q \lor R) \land (\neg R \lor S) \land (\neg S \lor \neg P) \land (P \lor T)$ If we branch by setting the decision literal $P = \text{True}$, which of the following describes the sequence of forced assignments and the immediate result of Unit Propagation?