Let A = {1, 2, 3} and B = {2, 3, 4}.

Consider the grammar defined by:

Which of the following is not parsed by the grammar?

True or False:

{1, 2} is equal to {2, 1}

Is the less-than-or-equal-to operator over the set of natural numbers a partially ordered set (poset)?

In other words, is S (as defined below) a poset?

S = <N, >

Explain your answer. You must provide accurate justification for your answer to receive credit.

Let A = {1, 2, 3} and R = {(1,2), (2,2), (2,1)} be a relation on A.

The number of elements in tsr(R) (the smallest equivalence relation containing R) is...

True or False:

An algorithm with a worst case of 2n operations and an algorithm with a worse case of 3n operations are both O(n).

According to our conventions, which of the following is a bag (also known as a multi-set)?