20 points Prove that each of the following language la. [10 points] {(N, D? : N is an NFA, D is a DFA, and L(N) L(D)} lb. | 10 points| ?R1. R-? : R1 and R2 are regular expressions over the same alphabet. and is decidable. Don't reinvent t he wheel ' every string matches exactly one of R or R2 (not both)