Working with Queues 1. Create a method on the Queue class that calculates the number of times a given value occurs in the queue. int Queue::count( const T & data ) const; Example: count(…) function Result Queue count (5) 3 front->(1) (1) (5) (3) (5) (5) (2)<-back count (10) 0 front->(1) (1) (5) (3) (5) (5) (5) (2)<-back

Problem 7: Assume that a queue class called XQueue has a no argument constructor, an enqueue() method, a dequeue() method and an isEmpty() method. Write a method that merges two given queues by copying the elements in an alternating sequence and returning the resulting combined queue. Note: make sure that you don't include unnecessary spaces in your answer! public XQueue merge(XQueue q1, XQueue q2) { XQueue neWQueue = new XQueue(); while (!q1.isEmpty() && !q2.isEmpty()) { newQueue.enqueue( #01 ); newQueue.enqueue( #02); } while (!q1.isEmpty()) { #03 ; } while (!q2.is Empty()) { #04 ; } return newQueue (); }

Asap do this? .

DONT use any of the list methods (append, pop etc.). class mycircularqueue():        def __init__(self, m = 10):        self.maxsize = m        self.array = [None]*m        self.FRONT = self.REAR = -1                def enqueue(self, item):         # Inserts item at the rear of a non full queue and returns True. If unable to insert the item returns false                #######################################################################        # Remove the pass statement and write your code        #######################################################################        pass     def dequeue(self):        # Removes the item from the front of the queue and returns it. For unsuccessful dequeue return False                #######################################################################        # Remove the pass statement and write your code        #######################################################################        pass        def peek(self):        # Returns the…

java Suppose queue is defined as LinkedQueue<Integer> queue = new LinkedQueue<>(); Show what is written by the following segment of code. SHOW YOUR WORK.

import java.util.*;import java.io.*; public class HuffmanCode {     private Queue<HuffmanNode> queue;        private HuffmanNode overallRoot;                 public HuffmanCode(int[] frequencies) {                queue = new PriorityQueue<HuffmanNode>();                                for (int i = 0; i < frequencies.length; i++) {                        if (frequencies[i] > 0) {                                HuffmanNode node = new HuffmanNode(frequencies[i]);                                node.ascii = i;                                queue.add(node);                        }                }                overallRoot = buildTree();              }                 public HuffmanCode(Scanner input) {                overallRoot = new HuffmanNode(-1);                while (input.hasNext()) {                        int asciiValue = Integer.parseInt(input.nextLine());                        String code = input.nextLine();                        overallRoot =…