Consider the following process state transition diagram for a computer system with a single processor. Assume that there are always some processes in the ready state:

new admitted A interrupt B exit D terminated ready running E VO or event completion scheduler dispatch F 110 or event wait waiting I. III. The OS uses preemptive scheduling. II. The OS uses non-preemptive scheduling. If a process makes a transition D, it would result in another process making transition A immediately. IV. A process P2 in waiting state can make transition E while another process P1 is in running state. V. V. Every process has to go through the Waiting state at some point. Which of the above statements are TRUE? Explain why each statement is true or false