There are n jobs to be run in a system that can run multiple jobs concurrently, but certain pairs of jobs cannot be scheduled at the same time step because they both need a particular resource. Over the next k time steps of the system, we need to schedule each job to run in at least one time step. Find out if such schedule is possible, if so, how to find such a schedule.

Thank you for the opportunity to help you with your question!

Over the next k time steps of the system, we need to schedule each job to run in at least one time step. so total is n job and time is k so n/k is answer

Please let me know if you need any clarification. I'm always happy to answer your questions.