The question asks for "Priority Queue" - assume minimum value is maximum priority. Now, if we use a min-heap we get $O(\log n)$ insertion and deletion. Here, deletion is mostly done for maximum priority (extract-min) and rarely for minimum priority or other values (can be even ignored as they do not consititute necessary priority queue functions). Find is also for maximum priority and can be done in $O(1).$
Now, if we use a sorted array, find will be $O(1)$ -- we search for maximum priority which should be the first value.
Insert will be $O(n)$ because we might need to shift all $n$ elements even if we can find the position in $O(\log n)$ time like in Insertion Sort.
Deletion will be $O(n)$ as we need to shift $n-1$ elements one place.
Min. heap clearly wins rt?