A)At which positions of a heap might the third smallest key be stored, root? Leftchild or rightChild of a root or some other node?

B)If a priority queue is implemented by an array-based sorted list, where (front, end or any position in the middle of the array) do you want to put the element whose priority is the highest, why? Where (front, end or any position in the middle of the array) do you want to put the element whose priority is the highest if the sorted list is implemented based on SinglyLinkedList, why?