1. The most appropriate way to implement a heap is with an array rather than a linked structure. Why? 2. Define the instance variables for a Java class that would be appropriate for a priority queue...

1. The most appropriate way to implement a heap is with an array rather than a linked structure. Why?

2. Define the instance variables for a Java class that would be appropriate for a priority queue implemented as a heap. Each node should have an integer priority and a piece of data that is a Java Object.