Step 1: Priority Queue Create a priority queue
{"Image DocumentName": "Step 1: Priority Queue Create a priority queue", "Image ImageDescription": "\uf0b7\uf0b7\uf0b7 Priority/TID. # of entries. Create a priority queue. typedef int TID; // task ID. typedel int Priority; // task priority. typedef int  PQueue; // priority queue. Write queue functions to add/delete elements. int enQ(PQueue q, TID tid, Priority p); int deQ(PQueue q, TID tid); q # | pr1/tid1 | pr2/tid2 | \u2026 tid >=0 find and delete tid from q. -1 return highest priority tid. int tid (if found and deleted from q) -1 (if q empty or task not found) typedef struct. { int size; union. { int element; struct. { uint8 tid; uint8 priority; } entry; } queue[100]; } PQueue; BYU CS 345. Project 2 - Tasking.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}