Let Σ = {a, b}. Give recursive definitions for the following languages over Σ. (i) The language BB of all words containing the substring bb. (ii) The language NOTBB of all words not containing the substring bb.