04: When a new value is inserted into a priority queue structure (implemented as a "heap") what is true about the location of the new value within the structure? (a) The new value will be the value of a leaf node. (b) The new value will be the value of an internal node. (c) The new value will become the new root value. (d) All of the above are possible. Q5. Heap data structures are complete binary trees; they can be stored in the form of a vector. When a new value is added to the heap data structure.. new value is inserted into the front of the vector and then swapped down the left and right child links until a placement is found that satisfies the heap property (b) .the new value is added to the back of the vector, and it remain (c) .. the new value is added to the back of the vector and then swapped up along the parent links until a placement is found that satisfies the heap property. ...the new value becomes the new root, and the old root is moved to the back of the vector. Q6. The code fragment 'Setintiterator itr s. begin (); s. end )) ++itr cout itr prints out what? wh (a) The highest value item in the set. (b) All elements in the set. (c) The addresses of all elements in the set. (d) None of the above. Q7. Let there be a Setvectornt> > SV: ove into SV. What does the following code do? r time, data series of type vector are inserted set >iterator itri sv.begin) int x ? 0; for (; itr! !-sv.end ( ); ++?tr1) vectorsiterator itr2 *itrl.begin) for ( itr2itrl.end ++itr2) (a) It counts how many elements in SV are non-empty vectors (b) It determines the size of SV in terms of number of vectors stored. (c) It counts the number of integers stored in SV. (d) It converts the set> data structure into a vector> data structure