We consider the problem of evaluating an expression consisting of unions and intersections of some sorted sets. Given the
expression and the sizes of the sets, we are interested in the worst-case complexity of evaluating the expression in terms
of the sizes of the sets. We assume no set is repeated in the expression. We show a lower bound on this problem and present
an algorithm that matches the lower bound asymptotically.