Task 1: Application of scheduling process in a control processor of a switch in a network System Details:- Design a system that uses a queue in a control processor of a switch in a network. A request for the establishment of a new virtual connection that arrives to the switch generates a job of type A. If that job has to wait for other jobs, it is put in a buffer. Finally, the job is executed and the connection is established. When the connection shall be taken down, a new job is generated. Some jobs have quite a long time to be processed and thus jobs with a short time which came in late need to wait quite a long time. The jobs that tear down connections (jobs of type B) have a higher priority than jobs of type A. Thus, when a job has been served, need to check if there are any jobs of type B in the buffer. If there are no jobs of type B in the buffer, the processor can start to serve jobs of type A, if there are any.

Demonstrate the scheduling process of a switch in a network by using queue.

Construct a program to demonstrate the problem.

Calculate the average waiting time for the jobs.

Task 2: Complexity Analysis - Theoretically discuss and compute the complexity of all algorithms that you implemented. The discussion will describe your understanding of the algorithm. Define the complexity of the algorithm by using Big O notation.

C language programming.

Algorithm and Data Structures.