imagine you are a system administrator, and as such, are responsible for running a monitoring program at any given point of time. however, there are multiple such programs that must be run in order of priority. this prioritization is important, because real-world factors can change the priority of a program at any given point. you have thus created a binary heap to store all the programs, so that the highest priority program can be identified immediately. now, you need to implement the notion of "changing the priority of a program". that is, you need to write code to increase the value of a node in a binary heap. write a java code to do this for a max heap, where the location of the node is already known to you. this is often considered an important binary heap operation. in our example, we will assume that the priorities are simply integer values, and the operation is called increasepriority(int loc, int increaseby). in a max heap of n nodes, how many leaf nodes must be examined in order to find the element with the lowest priority/value? draw the max-heap for the array [91, 62, 83, 50, 22, 37, 11, 44]. is this array a valid max heap? redraw the above heap after removing one element from it, and write down the arrays that you get if you perform the following traversals on the resulting heap: (i) inorder, (ii) preorder, and (iii) postorder.
