Compare empirically a top-down splay tree priority queue implementation with a binary heap by using a. Random insert and deleteMin operations b. insert and deleteMin operations corresponding to an...

Compare empirically a top-down splay tree priority queue implementation with a binary heap by using

a. Random insert and deleteMin operations

b. insert and deleteMin operations corresponding to an event-driven simulation

 c. insert and deleteMin operations corresponding to Dijkstra’s algorithm