this is in reference to c language (data structures)

(b) In a non-empty array of integers, the priority of a number is determined by the frequency of its occurrence. Elements are added as they come but the most frequent element is deleted first. If two elements have the same priority, then the element which came first will be deleted first. For example: nums = [1,2,3,1,3,1,3,2,3). After the first deletion now the array will be num=[2,3,3,3,2,3). Implement a priority queue for the aforementioned scenario. 8