Statement I: True
This is mutual exclusion.
At most one process can execute in the critical section at a time.
Statement II: True
This corresponds to progress.
If nobody is in the critical section and some process wants to enter, selection should not be postponed indefinitely.
Statement III: True
This corresponds to bounded waiting.
Once a process requests entry, there must be some finite bound on how long it can be postponed.
Statement IV: False
A process that cannot enter need not necessarily give up the CPU.
For example, some valid synchronization techniques use busy waiting or spinning.
Therefore immediate relinquishing of the CPU is not a fundamental correctness requirement.