Which of the following statements are True?

I. All unsafe states are deadlocks.

II. A deadlock-avoidance algorithm dynamically examines the resource-allocation state to ensure that a circular-wait condition can never exist.

III. To eliminate deadlock if a process and resources are selected for preemption on the basis of cost leads to starvation.