Code 1 uses a heap to implement priority queue. Draw the heap's condition after each step above in question1, on a piece of paper. There should be five heaps drawn on the paper. Question 1 steps Enqueue (10); Enqueue (100); Enqueue(20) Enqueue(5); Dequeue) Codel Heap.header template void swap(ItemType& one, ItemType& two); template class ItemType> l Assumes Item Type is either a built-in simple type or a class with overloaded relational operators. struct HeapType void ReheapDown(int root, int bottom); void ReheapUp(int root, int bottom); ItemType* elements; Il Array to be allocated dynamically template void Swap(ItemType& one, ItemType& two ItemType temp; temp one; one = two; two temp templatecclass ItemType> void HeapType ItemType>:ReheapUp int root, int bottom) // Post: Heap property is restored int parent; if (bottom> root) parent-bottom-l ) / 2; if (elements[parent] elements[bottom]) Swap(elements[parent],elements bottom ReheapUp(root, parent)