For each set S, show that the given partial order on S is well-founded. Let S be a set of trees. Let slt;t mean that s has fewer nodes than t. Let S…

For each set S, show that the given partial order on S is well-founded.a. Let S be a set of trees. Let s<t mean that s has fewer nodes than t.b. Let S be a set of trees. Let s<t mean that s has fewer leaves than t.