point out the incorrect statement.

Question $19$ options:

There are two main types of dynamic load balancing algorithms.

In a preemptive algorithm, the mapping of jobs to physical resources may change while a job is running.

In non$-$preemptive algorithms, once a job has started the physical resources assigned to that job cannot change.

The greatest obstacle related to dynamic scheduling, however, is that finding the optimal solution is NP$-$complete.