non-preemptive scheduling

Write a program to simulate a processor [login to view URL] perform the following.? a) Create a linked list structure with each node representing a process control block (PCB).b) The program should simulate a clock sequence, and be able to change states of processes using a non-preemptive scheduling scheme. c) Print the linked list structure after each [login to view URL] only three states for a process:Blocked State (B): Represents I/O [login to view URL] state (R): Waiting for the CPU..Current State (C): Using the CPU....test case ## Deliverables test cases to run: | Time (Seconds) | Activity | | 50 | I/O | | 150 | CPU | | 60 | I/O | | 100 | CPU | | 90 | I/O | | Time (Seconds) | Activity | | 120 | CPU | | 20 | I/O | | 30 | CPU | | 20 | I/O | | Time (Seconds) | Activity | | 10 | I/O | | 20 | CPU | | 40 | I/O | | 10 | CPU | | 5 | I/O | please use JAVA..........its a must