Design (in outline) algorithms for determining whether the language described by a regular expression r over the alphabet {0,1} is (a) empty, i.e. L(r) = \, (b) contains all possible binary strings, i.e. L(r) = {0, 1}*