Implement a heap-based priority queue CLASS containingcharacters using a zero-based ARRAY of these records. You mayassume that the heap will contain no more than 255 elements.Implement two functions “insert” and “remove”. Function “insert”takes a character as an input and insert it to the priority queue.Function “remove” removes a character with the highest priority,that is to remove the minimum (alphabetically first) character fromthe queue. Provide the class in C++. Also, write a simple separateprogram that uses the heap-based queue class.
Expert Answer
An answer will be send to you shortly. . . . .