Suppose there are n jobs to be processed on a machine. Each job has an optional pair of processing time intervals. the n jobs are schedulable if there are n non$-$overlapping time intervals, one from the optimal pair of each job. We would like to decide whether the n jobs are schedulable or not. Formulate this problem as an instance of $2-$SAT