Give a decision problem corresponding to each of the search problems given below. a.
Input: A set of classes to be scheduled. A list of pairs of the classes which can not be scheduled during the same period.
Output: The largest set of classes that can all be scheduled during the same period.

b.
Input: A set of classes to be scheduled. A list of pairs of the classes which cannot be scheduled during the same period.
Output: A schedule for the classes that uses the smallest number of periods.