Let & be the alphabet that contains the following symbols: 0 a b { },u Design a CFG that accepts the following language: L = {w * | w represents a syntactically valid set}. Synactictically valid" just means that the set makes mathematical sense and has valid syntax. We do not require a string in L to be written in the simplest way possible. For example, the strings {0,0} and {} belong to L even though these can also be written more simply as {0} and ), respectively. Examples of strings in L: 0 {0, {a} U {b}} U{b} U 0 {0,0} {{{b}}} {a,t}} f} Examples of strings not in L: }a{ . 0{b} {a,,b} {ab} {} {ab}