Give an O(n m)-time algorithm to determine whether a given set C of inequalities is consistent over the positive integers. c. If the set of inequalities has a solution over the positive integers, then it has a unique minimum solution, i. e. a solution in which every variable has the minimum value among all possible solutions. For example the minimum solution for the set