You are given jobs and need to schedule them. Each job is of one time unit duration but provide different profits for the company. Consider the sort as shown below Total Jobs TJ done and the Maximum Profit MP. 1 Sort the jobs based on decreasing order of profit. 2 Create two variables, TJ = 0, MP = 0. 3 Find the maximum deadline among all the jobs. 4 Initialise a set storing all the jobs in decreasing order of profit. 5 Iterate through the jobs and perform the following: i. If the set is empty or the deadline of the current job is less than the last element of the set, ignore the job. ii. Else, apply binary search dividing by deadline < or> i. Find the nearest Slot i, such that i deadline and add the profit. iii. Increment total jobs by 1 and remove the ith element from the set. 6 Return the maximum profit. e.g. 'Item number', complete by, profit [['a', 3, 35], # Job Array arr = ['b', 4, 30], ['c', 4, 25], ['d', 2, 20], ['e', 3, 15], ['f', 1, 12], ['g', 2, 5]] Maximum profit sequence of jobs: dc ab Profit 110 Answer the following questions on this problem (Do not provide code) (a) Do we need to do the initial sort of the jobs array? Why or why not. (b) What will be the efficiency of this algorithm by calculating from the steps of the pseudo code? Explain how you calculated this.

Q: Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort…

A: Bubble sort: Bubble sort repeatedly compares and swaps(if needed) adjacent elements in every pass.…

Q: Step 1 In this step, we begin by filling in the following table with the values of a, b and the…

A: Euclidean Algorithm is used to find the greatest common divisor (gcd) of two numbers a and b.

Q: Complete the partition () function which takes a single list of integer values data as a parameter.…

A: Please find the answer below :

Q: Assume that the values A through H are stored in a self-organizing list, initially in ascending…

A: Answer :

Q: Only authorized shareholders are allowed to attend a stockholders’ meeting. Write a program to read…

A: #include&lt;iostream&gt;#include&lt;string.h&gt; using namespace std;  int main(){    int n,k=0;…

Q: Write a function insertionsort(somelist) that applies the insertion sort algorithm. (You should use…

A: Input: None (Accept user input during execution)Output: sortedlist (a list of sorted elements)1.…

Q: How do I add this code to the code that is to go with this lab. It's telling me to copy it and paste…

A: The given code is updated and the expected output is produced. You can use this code for your lab

Q: int total = 4; //L1 while (total <= 24) //L2 { total = total + 10; } System.out.println(total); //L3…

A: int total =4; //Initialize total=4 while(total &lt;=24) // Check if total is less than 24 or not {…

Q: You may use any of the following: Decision, Merge, Fork, Join, Action, Object and any other nodes.…

A:

Q: def difference(self, source): Efficiency: Return a set that contains the items that only exist in…

A: Provided code is well commented for better understanding. Code snippet is provided below the typed…

Q: def count_non_overlapping(s, substr, start): Return the number of non-overlapping occurrences of…

A: def is_palindrome(s):    return s == s[::-1] def is_even(d):    return (d % 2) == 0 def…

Q: We want the program to use a DEQueue object to create a sorted list of names. The program gives a…

A: Here's an implementation of the program using a Deque object to create a sorted list of names:

Q: We want the program to use a DEQueue object to create a sorted list of names. The program gives a…

A: Programming Approach : Import the deque class from the collections module. Create an empty deque…

Q: Write a program that allows the user to sort using the Heap Sort and Bin/Radix Sort. The program…

A: Heap Sort Algorithm:Heap Sort is a comparison-based sorting algorithm that uses a binary heap data…

Q: Which campsites are available to reserve? We want to be able to quickly find which campsites are…

A: Here I have created a function named availableCampsites(). In this function, I have created an array…