Please give a complete answer using dynamic queue c++. I saw the answers to this question on this platform so please don't give the same answer. I don't want the same answer that you will copy because you don't know the answer and simply copy-paste others answers. you can take your time to finish but please give a proper and correct answer.

Consider the following situation in a computer science laboratory. On any average day about 10 students are working in the lab at any given hour. These students uses the shared printer in the lab to print their assignments and reading materials. The time taken for printing tasks varies from one another depending on the pages volumes printed by students. Students can send printing instructions from any terminals attached to same network of the printer. Hence, many students can do so at once. Below is the six printing job (each labelled as Task ID) that await to be printed along with their printing time and arrival time. Note that time unit starts with t0.

Explain how can the printer handles the many instructions. Show your solution in terms of flowchart and full program. Make sure your program use dynamic queue as the data strcuture and simulates the whole executions till completion. Your program should prints the time when the print job from each student started and their waiting time. It also need to calculate the time needed to complete all printing jobs and the average waiting time.

Task ID T1 T2 T3 T4 T5 T6 Table 1 Execution Time Arrival Time 3 unit time to 5 unit time t1 2 unit time t3 4 unit time t6 6 unit time t10 1 unit time 114 The timeline of printing job arrival time for Table 1 is illustrated in Figure 1 (up until the last job arrived). to ti tz t3 T1| T2 T3 Arrival Time t4 |ts to to to to to tu | t12 | 13 | 14 T4 T5 T6 Figure 1 Task ID T1 T2 T3 T4 T5 T6 Table 1 Execution Time Arrival Time 3 unit time to 5 unit time t1 2 unit time t3 4 unit time t6 6 unit time t10 1 unit time 114 The timeline of printing job arrival time for Table 1 is illustrated in Figure 1 (up until the last job arrived). to ti tz t3 T1| T2 T3 Arrival Time t4 |ts to to to to to tu | t12 | 13 | 14 T4 T5 T6 Figure 1