hello , please tell me how to implement priority N-queue. the problem statment is as fallows (Q)Describe possible variations on a “priority n-queue,” where each object in the queue is an n-tuple, with each element of the n-tuple having both a value and a priority. Write detailed specifications for three of the non- trivial cases (i.e., where more than 1 of the elements is considered to determine which object will be de-queued), and write implementations for all of them. Write a separate program which uses one or more of these implementations.

Search "priority Queue" without quotes using the above search box and you will some good samples links.