I. Find the compatible schedule with the maximum value. Write the pseudocode

to print the solution using backtracking.

II$.$ Find the maximum subset of mutually compatible jobs. You must mention the

logic applied for computing the answer.

III. Explain which algorithmic design technique you have applied for finding your

solution for both the cases $($I$)$ and $($II$)$ and why.