This exercise will test you to see if you can apply what we have learned in this course, and thus it will

prepare you for the final.

Q$1)$ You are writing a program that simulates a hospital emergency department$$s triage. Two tasks that

need to be performed efficiently are:

a$)$ inserting a new patient$$s information into the waiting list when they arrive $($which patient is

next seen by a doctor is determined by the severity of their ailment.$)$

b$)$ removing the patient information from the waiting list.

Which of the following data structures should be used to store this waiting list? A$,$B$,$C or D$.$ Fill in the

blank. $[2$pts$]$

A$.$ Regular Queue

B$.$ Stack

C$.$ Heap$-$Sort Tree

D$.$ BST $($balanced