Create a generic PriorityQueue class, which stores its QueueItem items in a private list. The PriorityQueue has two methods: Add and Next.
The Add method adds a QueueItem to the end of its private list.
The Next method returns with the value of the highest priority item from the start of the list. It removes the returned item from the list. If it finds an item with a 0 priority, it removes the item, and jumps to the next one. If there are no more items in the list, it returns with a null value.
The PriorityQueue class can be iterated through with foreach. In this case, it does not remove its returned elements. The foreach loop returns items in the same order as the Next method, jumping through 0 priority items, but not removing them (e.g. [A(0), B(1), C(2), D(0), E(1)] -> C, B, E). Unlike the Next method, a foreach returns QueueItems, not their stored values.
The QueueItem stores a generic value and an integer priority.
Test cases:
CS 340 Milestone One Guidelines and Rubric Overview: For this assignment, you will implement the fundamental operations of create, read, update,
Retail Transaction Programming Project Project Requirements: Develop a program to emulate a purchase transaction at a retail store. This
7COM1028 Secure Systems Programming Referral Coursework: Secure
Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip
CS 340 Final Project Guidelines and Rubric Overview The final project will encompass developing a web service using a software stack and impleme