Edit the already existing code to use dictionaries instead if lists

PROBLEM 2: Implement Queue with a dictionary 1. In our Queue implementation using lists either the enqueue or the dequeue has time complexity O(n). Could we build a more efficient Queue if we use dictionaries instead of lists? Update the Queue class to use a dictionary rather than a list as the internal data structure. Here are some things to think about when designing your solution: a. A Queue has to keep track of its head and tail. You may find it helpful to store this information in self. b. Items are removed from the Queue in order of their arrival. c. It may be helpful to think about the deli at a grocery store where customers grab a ticket with a number when they arrive at the deli. The deli worker serves customers calling out ticket numbers starting with the lowest numbered ticket. d. A dictionary can store a key value pair. e. In the grocery deli example, customers are essentially being placed into a dictionary with their ticket numbers as kevs