Answer in Python. Fill in where it says YOUR CODE HERE. Make sure it passes the tests provided

def counting_queue_in(self, el): # YOUR CODE HERE CountingQueue. in = counting_queue_in # 0 points. Simple cases. q = CountingQueue () assert "cat" not in a q.add("cat", count=2) assert "cat" in q assert "dog" not in a q.add("dog") assert "cat" in q assert "dog" in q q.get() assert "cat" in q assert "dog" in q q.get() assert "cat" not in a assert "dog" in q q.get() assert "cat" not in a assert "dog" not in a [40] # 0 points. Behaves the same as Queue. elements = range(5) for k in range (100): qo = Queue() ql = CountingQueue () for in range (20): el = random.choice(elements) qo.add(el) ql.add(el) for x in elements: assert (x in qo) == (x in q1) def counting_queue_in(self, el): # YOUR CODE HERE CountingQueue. in = counting_queue_in # 0 points. Simple cases. q = CountingQueue () assert "cat" not in a q.add("cat", count=2) assert "cat" in q assert "dog" not in a q.add("dog") assert "cat" in q assert "dog" in q q.get() assert "cat" in q assert "dog" in q q.get() assert "cat" not in a assert "dog" in q q.get() assert "cat" not in a assert "dog" not in a [40] # 0 points. Behaves the same as Queue. elements = range(5) for k in range (100): qo = Queue() ql = CountingQueue () for in range (20): el = random.choice(elements) qo.add(el) ql.add(el) for x in elements: assert (x in qo) == (x in q1)