I need a quick right solution, please

MODULE: CIS2206 Algorithms and Data Structures Activity 2 (Portfolio Task): A High Performance Computing (HPC) server receives requests from users, running computationally intensive programs. For simplicity, we adopt an abstract time period between [0,19], i.e. a total of 20 time units. User requests could arrive at any point as follows: At time 0, Program A is submitted requiring 2 time units to run At time 0. Program B is submitted requiring 1 time units to run At time 2, Program C is submitted requiring 2 time units to run At time 3. Program D is submitted requiring 4 time units to run At time 3, Program E is submitted requiring 1 time units to run At time 3. Program F is submitted requiring 3 time units to run At time 7. Program G is submitted requiring 1 time units to run At time 11. Program H is submitted requiring 2 time units to run At time 12, Program I is submitted requiring 1 time units to run At time 15, Program J is submitted requiring 3 time units to run There are two implementations of the HPC server. 1. The HPC server is implemented based on a queue 2. The HPC server is implemented based on a priority queue Based on the above (for both queue and priority queue); Recreate the state of the HPC server at every time unit Show the state of the queue after each event takes place Calculate waiting times for each program as well as average waiting times for the server Note: At any given time, if multiple enqueueidequeue (resp. insertiremoveMin) operations take place, enqueue (resp. insert) takes place before dequeue (resp. removeMin). Assume that the priority queue is sorted during insertion. Assume also that the HPC server runs only one program during a given time unit. Discuss your progress with your Tutor during practical sessions. What to include in your Portfolio: Report - Activity 2: Include in your report (a) the state of the HPC server at every time unit, (b) the state of the queue after each event takes place, and (c) waiting times for each programme as well as average waiting times for the server. Include your answer for two implementations of the HPC server: 1. The HPC server is implemented based on a queue 2. The HPC server is implemented based on a priority queue