13
Exercise 1: Implement a Priority Queue
Use a fixed sized un-ordered array. The function, enterPriorityQueue should return 0 if the array is full
Modify your solution to use a dynamically allocated array that can use realloc if the array gets full.