For each 1 ≤ i ≤ n job ji is given by two numbers di and pi, where di is the deadline and pi is the penalty. the length of each job is equal to 1 minute and once the job starts it cannot be stopped until completed. we want to schedule all jobs, but only one job can run at any given time. if job i does not complete on or before its deadline, we will pay its penalty pi. design a greedy algorithm to find a schedule such that all jobs are completed and the sum of all penalties is minimized. what is the running time of your algorithm

Write a method replacekey in the minheap class with the following signature: public void replacekey(integer oldkey, integer newkey) the method will replace the first occurrence of oldkey with the newkey, and restore the min-heap property after the change. if the oldkey does not exist in the heap, the method prints an appropriate message and returns without changing the heap. example: suppose our binary heap object (bh) has the following keys: *** 4 6 7 32 19 64 26 99 42 54 28 then the method call: bh. replacekey (oldkey integer(54), newkey integer(2))

This technology is used to produce high-quality documents that look good on the computer screen and in print.

The three logical operators used to write compound conditions are "and," "or," and "not." a: true b: false