Compare and contrast three implementations for a priority queue in terms of an explanation of: what the data structures represent; a sketch of the principal routines; and O(f(n)) timings when it is...

Compare and contrast three implementations for a priority queue in terms of an explanation of: what the data structures represent; a sketch of the principal routines; and O(f(n)) timings when it is implemented as (a) an (unsorted) array (b) a sorted array