In the space provided, create a heap by inserting each of the items in the following list into the heap, one item at a time,

8. (2 points) In Priority Queues, the item with the highest priority, or importance, exits the data structure before anything less important. By convention, lower numbers represent items of priority, so one frequently uses a for this behavior A. lower, min-heap B. lower, max-heap C. higher, min-heap D. higher, max-heap 9. (6 points) In the space provided, create a heap by inserting each of the items in the following list into the heap, one item at a time, as if the numbers represented priorities for a queue of customers arriving in real time Priorities: 55, 0, 0, 92, 1, -82, -8, 0, 2, 11, 13, 37 10. (2 points) A heap containing 1,048,576 items must have, at most, how many edges from its root to its farthest leaf? Answer: 11. (2 points) What is the array index for the parent of an item located at index 12 in a heap? The heap's root uses index 0