Consider the decision version of the job scheduling problem from the exam. We have a number of jobs to be run that all require exclusive use of a shared resource. The i th job has a deadline di $,$ a profit p$,$ and takes $1$ unit of time for which the job requires exclusive access of the shared resource. Only one job can use the resource at a time and you can schedule any jobs at any time before their deadline; assume that time starts at $0.$ Is there a scheduling of jobs with profit at least P$?1.$ Is it true that the decision version of Job Scheduling $$p Node Cover? Either say it is unequivocally true $($and why$),$ it unequivocally is not true $($and why$),$ or that you cannot be $100\%$ sure $($and why$).2.$ Is it true that the decision version of Job Scheduling $$p Node Cover? Either say it is unequivocally true $($and why$),$ it unequivocally is not true $($and why$),$ or that you cannot be $100\%$ sure $($and why$).$