Because the pairing heap uses dynamic memory, we will need to implement a custom copy constructor, destructor, and assignment operator. The copyswap method can be used to implement the assignment operator (make a temporary copy of the other pairing heap and swap the contents of the current pairing heap with the temporary one). When implementing the copy constructor, we cannot just copy over the root node's pointer we must walk through the entire tree and copy over every node. Note that the structure of the heap does not need to be the same between the original and the copy. As long as the copy is still a valid pairing heap that holds the same elements, the copy is valid. To walk through all the elements of a pairing heap, we will utilize a queue to store the elements we have yet to visit. Whenever we visit a node in the pairing heap, we push a copy to our new pairing heap and push all of the node's direct connections (chi l d and s ibl ing) into the queue this ensures that all nodes in the heap will be pushed into the queue at some point during our algorithm. Then, we use the following process to make a copy of the pairing heap: 1. Push the root node of the pairing heap into a queue. 2. Retrieve the node at the front of the queue and pop it off. 3. Add all the direct connections of the node into the queue. If the node that was taken out has a child, push the child into the queue. If the node that was taken out has a sibling, push the sibling into the queue. 4. Push the value of the node that was taken out of the queue into the new pairing heap that is being copy constructed. . Repeat steps 2-5 until the queue is empty. U1