or each of the following scheduling problems, either say that it is np-hard, or give the name of the algorithm which solves the problem optimally. no further explanation is required.