Slove the Following Problems

Given an array of jobs where every job has a deadline and associated profit if the job is finished before the deadline, we want to search for a set of jobs that maximize the total profit. We notice that only one job can be scheduled at a time, one processor is available for processing all the jobs, and the processor takes one unit of time to complete a job.

Give the steps of the greedy algorithm that can solve the job sequencing problem with deadlines.

Apply the algorithm to solve the problem presented in the following table

$\backslash$table$[[$Index$,0,1,2,3,4,5],[$Job$,$J $1,$J $2,$J$3,$J$4,$J$5,$J$6],[$Profit$,10,15,20,30,25,15],[$Deadline$,3,2,1,2,2,3]]$

Consider the capacity of a fractional knapsack $W=7$ and the list of $5$ items. Use the dynamic programming algorithm to find the maximum profit with the corresponding items.

$\backslash$table$[[$Items$,$I$1,$I$2,$I$3,$I$4,$I$5],[$Profits$,8,12,18,22,20],[$weights$,1,5,2,4,3]]$

$V[i,j]=\{\begin{array}{ccc}0& ifi=0or& j=0\\ V[i-1,& j]if& j=w\end{array}$

${?}^{****}$ All the Best ${?}^{****}$

$\frac{?}{1}$