2) Questions about standard ADT’s and their implementations that we have studied, including asymptotic analysis of their operations under various implementations. A DougPriority Queue uses time (real numbers, not ints) for its priorities. The bigger the time of an item the more important it is. Describe a good time-efficient implementation of DougPriority Queue. What is the big performance of your implementation for the 2 most important operations. Show a picture of your implementation when the following 4 items are in your Doug Priority Queue: name=Bob,time=2.31 name=Jim, time=17.2 name=Bill, time=11.1 and name=Tom,time=22.