Heap  is used to implement the priorityqueue. Revise the implementation using a sorted array list to store the elementsand name the new class PriorityUsingSortedArrayList. The elements inthe array list are sorted in increasing order of their priority with the last elementhaving the highest priority. Write a test program that generates 5 million integersand enqueues them to the priority and dequeues from the queue. Use the samenumbers for MyPriorityQueue and PriorityUsingSortedArrayList anddisplay their execution times.

Create a class called ResizingArrayQueueOfStrings that uses the queue abstraction using a fixed-size array. Then, as an extension, use array resizing in your implementation to get rid of the size restriction.

please answer with proper explanation and step by step solution.

In python. Write a LinkedList class that has recursive implementations of the add and remove methods. It should also have recursive implementations of the contains, insert, and reverse methods. The reverse method should not change the data value each node holds - it must rearrange the order of the nodes in the linked list (by changing the next value each node holds). It should have a recursive method named to_plain_list that takes no parameters (unless they have default arguments) and returns a regular Python list that has the same values (from the data attribute of the Node objects), in the same order, as the current state of the linked list. The head data member of the LinkedList class must be private and have a get method defined (named get_head). It should return the first Node in the list (not the value inside it). As in the iterative LinkedList in the exploration, the data members of the Node class don't have to be private. The reason for that is because Node is a trivial class…