A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given n processes to be scheduled on one processor, how many possible different schedules are there? Give a formula in terms of n.

n! (n factorial = n × n – 1 × n – 2 × ... × 2 × 1).