A priority queue is a data structure that supports storing a set of values, each of which has an

associated key. Each key$-$value pair is an entry in the priority queue. The basic operations on a

priority queue are:

insert $($k$,$ v$)-$ insert value $v$ with key $k$ into the priority queue

removeMin $()-$ return and remove from the priority queue the entry with the smallest key

Two simple implementations of a priority queue are an unsorted list, where new entries are added

at the end of the list, and a sorted list, where entries in the list are sorted by their key values.

Fill in the following table to give the running times of the priority queue operations for these two

implementations using $O()$ notation. You should assume that the implementation is reasonably

well done, for example, not performing expensive computations when a value can be stored in

an instance variable and be used as needed.

Draw and fill the table in your exam script.