do in c# if required to code otherwise answer

Question 3: Priority Queues (7 marks) a) (4 marks) A priority queue may be implemented as either a sorted array or an unsorted array Comment on the time complexity for each implementation (in terms of the big-Oh notation) with regard to the methods Insert and Remove. Assume that the priority queue contains n elements and that elements (when sorted) are ordered by priority b) (3 marks) If the priority of elements in a binary heap H is suddenly inversed (i.e. higher priorities become lower priorities), is it always sufficient to simply reverse the elements in H to fix the heap? Show why or why not. For example: 10 20 30 40 50 50 30 20 10 4 4