The project identifier, in a text file, which is safe to copy and paste
from (PDF files are NOT safe to copy from):

9504853406CBAC39EE89AA3AD238AA12CA198043

For Part B you're going to be implementing three different versions of
a priority queue:

0) Unordered (completed for you)
1) Sorted
2) Binary heap
3) Pairing heap

You ARE given templated starter files for these.  Start reading about
the Pairing heap, and start thinking about implementation.  You will
need to use the "left child, right sibling" approach, NOT a vector or
deque of child pointers.